View stunning SlideShares in full-screen with the new iOS app!Introducing SlideShare for AndroidExplore all your favorite topics in the SlideShare appGet the SlideShare app to Save for Later — even offline
View stunning SlideShares in full-screen with the new Android app!View stunning SlideShares in full-screen with the new iOS app!
Trees are a useful and efficient way to implement other collections
In our analysis of list implementations in Chapter 8, we described the find operation as expected case n/2 or O(n)
However, if we implemented an ordered list using a balanced binary search tree , a binary tree with the added property that the left child is always less than the parent which is always less than or equal to the right child, then we could improve the efficiency of the find operation to O(log n)