Unformatted text preview: = 1 + max(height(l), height(r)) So: Heights Nodes 1 32, 48, 62, 88 2 17, 50 3 78 4 44 By making sure that the height of the children differ by at most one, we make sure that the height is O(log n) Assume unbalanced tree where height is not O(log n)...
View
Full Document
 Fall '08
 Staff
 Height, balanced binary tree

Click to edit the document details