Contents    Page-10    Prev    Next    Page+10    Index   

Big O for Trees

If a tree is uniform and balanced, we can describe it in terms of several parameters:

Note that most of the nodes are on the bottom row of the tree. If b = 2, half the nodes are on the bottom; if b is higher, an even greater proportion will be on the bottom.

In general, a tree algorithm will have Big O: