lec0330-AVLanalysis - Announcements: MP5 available. Due...

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

View Full Document Right Arrow Icon
Announcements: MP5 available. Due 4/1, 11:59p. Exam 2: Tue, 4/5, 7-9p, locations TBA on Exams page of web site Today: Balanced BST– Weiss, 4.4 AVL tree analysis – Is it an efficient structure? A nifty bug:
Background image of page 1

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

View Full DocumentRight Arrow Icon
AVL tree removals: Similar to BST Removals (0-child, 1-child, 2-child) but… Note that on an insert, at most one rotation is necessary, BUT 5 9 7 8 4 1 3 10 12 2 6 11
Background image of page 2
_____Worst case for insertion into a Binary Search Tree. _____Worst case for removal from a Binary Search Tree. _____Worst case for an algorithm to return all keys that are greater than 20 and that are multiples of 3 in a Binary Search Tree. _____Worst case for insertion into an AVL Tree. _____Worst case for an algorithm to return all keys that are greater than 20 and that are multiples of 3 in an AVL Tree. _____Level order traversal of an AVL Tree. _____Build an AVL tree with keys that are the numbers between 0 and n, in that order, by repeated insertion into the tree. _____Build a binary search tree with keys that are the numbers
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 8

lec0330-AVLanalysis - Announcements: MP5 available. Due...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online