{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Search Trees_Part_9 - Running Times for AVL Trees a single...

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

View Full Document Right Arrow Icon
Last Updated: 3/3/10 6:14 PM CSE 2011 Prof. J. Elder - 41 - Running Times for AVL Trees ± a single restructure is O(1) ² using a linked-structure binary tree ± find is O(log n) ² height of tree is O(log n), no restructures needed ± insert is O(log n) ² initial find is O(log n) ² Restructuring is O(1) ± remove is O(log n) ² initial find is O(log n) ² Restructuring up the tree, maintaining heights is O(log n)
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