This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: tree in level-order. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time. Prove your time bound. Q4. (a) Show the result of inserting the following keys into an initially empty 2-3 tree: 3, 1, 4, 5, 9, 2, 6, 8, 7, 0. (b) Show the result of deleting 0 and then 9 from the 2-3 tree created in part (a)....
View Full Document
- Fall '06
- N+1 NULL pointers