{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

End of Term Review 1.4

End of Term Review 1.4 - AVL Trees AVL trees are balanced...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Updated: 4/1/10 2:37 PM CSE 2011 Prof. J. Elder - 16 - AVL Trees ± AVL trees are balanced. ± An AVL Tree is a binary search tree in which the heights of siblings can differ by at most 1. height 0 0 0 0 0 0 0 0 0
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon