10/12/2016
CS 251, LE 2
Clicker Questions
Week 8
25 is deleted (with successor replacement)
What does not hold after the deletion?
A. The node holding 25 is spliced out
B. After the deletion, 30 is a child of 10
C. After the deletion, the root holds 30
D.After the deletion, the tree has 7 nodes
1
10/12/2016
40 is deleted (with successor replacement)
What holds after the deletion?
A. The root contains 55; the right child contains 70
B. The root contains 30; the left child contains 10
C. The root contains 60; the left child contains 40
D.The root contains 55; the right child contains 60
For which non-leaf node u is the predecessor
of u not the minimum in the subtree rooted
at the left child of u?
A.14
B.6
C.10
D.7
2
10/12/2016
The preorder traversal of the tree shown below
visits nodes in the order …
10
5
15
2
9
7
20
A.
B.
C.
D.
E.
2 5 7 9 10 15 17 20 30
2 7 9 5 17 30 20 15 10
10 5 15 2 9 20 7 17 30
10 5 2 9 7 15 20 17 30
None of the above
17 30
The binary search tree shown below was
constructed by inserting a sequence of items into an
empty tree.
Which of the following input sequences will not
produce this binary search tree?
A. 5 3 4 9 12 7 8 6 20
B. 5 9 3 7 6 8 4 12 20
C. 5 9 7 8 6 12 20 3 4
D. 5 9 3 6 7 8 4 12 20
E. 5 9 7 3 8 12 6 4 20
3
10/12/2016
Which of the following is not a property
of a Binary Search tree of size n?
A. All keys in the left subtree are less
than the root
B. All keys in the right subtree is greater
than the root
C. The height of the tree is at least log n
D. The left and right subtrees are of
equal size
4