Binary Search Tree Implementation In Java

An implementation of the Binary Search Tree written in Java.

Average runtime complexity for all methods:

search(T element) -- O(log(n))

insert(T element) -- O(log(n))

size() -- O(1)

leaves() -- O(n)

height() -- O(n)

toString() -- O(n)  

Worst runtime complexity for all methods:

search(T element) -- O(n)

insert(T element) -- O(n)

size() -- O(1)

leaves() -- O(n)

height() -- O(n)

toString() -- O(n)