Dale - Computer Science Illuminated 343

Dale - Computer Science Illuminated 343 - 31. Name the...

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

View Full Document Right Arrow Icon
316 Chapter 9 Abstract Data Types and Algorithms 28. What is the state of the stack after the following sequence of Push and Pop operations? Push anne Push get Push your Pop Push my Push gun Pop 29. What is the state of the queue after the following sequence of Enque and Deque operations? Enque my Enque your Deque Enque get Enque anne Enque gun The following tree is used in Exercises 30 through 36. 30. Name the content of each of the leaf nodes.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 31. Name the content of each of the nodes that has just one child. 32. What is the height of the tree? 33. Name the content of nodes that are the ancestors of the nodes whose content is 7. 34. How many comparisons does it take to find the following items or determine that the item is not in the tree? a. 1 b. 9 c. 35 d. 16 e. 35 tree 25 26 30 35 40 15 8 7 2...
View Full Document

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online