This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The Binary Trees, in worst case, might be left-heavy or right heavy or even a tree having nodes with only left children or only right children cause the searching be done in O(n).
The trees given in figure are just like a linked-list for which the searching is done in O(n) :)