This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3, 1. 2) What is the height of the above tree? What is the depth of the node containing the key 14? 3) There are 24 possible ways in which we could insert the keys 1, 2, 3 and 4 into a (initially empty) binary search tree. Of these, how many would result in a tree of height = 3? (For example, the sequence 1, 4, 3, 2 will produce such a tree.) Answer the same question for the collection {1, 2, 3} and {1, 2}. Can you guess a general formula for this number? 4) Exhibit the expression tree corresponding to the expression: ((a + b * c))* d + e * (f + g) 5) Preorder traversal of a binary search tree produces the sequen...
View
Full
Document
This note was uploaded on 02/08/2014 for the course CS 315 taught by Professor Kooshesh,a during the Fall '08 term at Sonoma.
 Fall '08
 Kooshesh,A
 Data Structures

Click to edit the document details