{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# lecture22 - CSCI-255 Advanced Data Structures Lecture 22...

This preview shows pages 1–4. Sign up to view the full content.

CSCI-255 Advanced Data Structures Lecture 22

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

View Full Document
Recap from Last Lecture box3 Asymptotic time complexity of basic BST operations (i.e., Search, Insert, Delete) is O( h ) where h is the height of the tree square6 BSTs are limited because of their bad worst-case performance O( n ), which is no more efficient than a regular linked list box3 Balanced search trees are trees whose heights in the worst case is O(lg n ) box3 A number of techniques to properly balance a binary tree square6 Some consist of deconstructing the tree, placing elements in array, sorting, and then reconstructing the tree square6 Some consist of constantly restructuring the tree when new elements arrive or elements are deleted and lead to an unbalanced tree (i.e., self-balancing trees)
AVL Trees box3 Tree rebalancing can be performed locally if only a portion of the tree is affected after insertion or deletion. An AVL tree is a self- balancing tree box3 AVL (Adel`son-Vel`skii and Landis) tree = square6 A BST square6 With the property

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

lecture22 - CSCI-255 Advanced Data Structures Lecture 22...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online