First page Back Continue Last page Summary Graphic
Balanced structures
Standard Binary Tree
- worst case performance is O(n)
Take advantage of partioning scheme
- Idea
- Identical to binarySearch
- Get down to logarithmic running time for all operation
- Insight
- Keep both partition balanced (approximately same size)
- Enfore additional properties to achieve this goal