Summary and Analysis

Binary Search in Trees

Problems 1

Problems 2

Once you have gone through the hard work of building a binary search tree
for your data, the pay-off comes in the form of efficient searchs through
the data set. Data in a binary search tree can be searched in
O(log(n))
time. This makes it worthwhile to put frequently searched data sets into
tree form.

The method we will use for finding data in a binary search tree is quite
similar to the one that we used in Section 1 to find where in the tree
to insert new elements. In other words, we will traverse the tree,
going left or right according to whether the element we are looking for
is less than or greater than the data in the current node. If the data
we are looking for is actually in the tree, we will eventually find it.
If not, we'll eventually run off the bottom of the tree.