2c03-review - 00059

2c03-review - 00059 - insert(7) 9 9 8 10 8 10 8 7 9 9 9 7 7...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
2 2.[30] AVL trees are a good implementation of binary search trees. Show (step by step) the AVL trees formed by inserting the numbers 10, 9, 8, 7, 6, 5, 4, 3, 2, 1. 10 10 10 9 9 insert(10) insert(9) insert(8) repair
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: insert(7) 9 9 8 10 8 10 8 7 9 9 9 7 7 insert(6) repair insert(5) repair insert(4) 8 10 7 10 7 10 6 9 6 9 7 6 8 6 8 5 8 10 5 8 10 6 5 4 7 7 7 repair insert(3) insert(2) 5 9 5 9 5 9 4 6 8 10 4 6 8 10 4 6 8 10 3 3 2...
View Full Document

Ask a homework question - tutors are online