WorksheetsPDS - 04225 Trees - Chapter 6
Total questions: 10
Worksheet time: 5mins
Name
Class
Date
1.
Which one is the root node?.
a)
Carvey
b)
Adams
c)
Smith
d)
Jones
2.
The tree high is:
a)
2
b)
4
c)
5
d)
3
3.
A directory in a file system tree is always an internal node.
a)
True
b)
False
4.
A file in a file system tree is always a leaf node.
a)
True
b)
False
5.
Does node 750 and the node's sub-trees obey the BST ordering property?
a)
Yes
b)
No
6.
In searching for 145, what node is visited first?
a)
25
b)
900
c)
100
d)
300
7.
Given the following tree, what is the worst case (largest) number of comparisons given a BST with N nodes?
a)
1
b)
3
c)
5
d)
4
8.
The successor for 150 is 250.
a)
True
b)
False
9.
When searching for key 21, what node is visited second?
a)
12
b)
23
c)
21
d)
18
10.
When searching for key 45, what node is visited third?
a)
33
b)
14
c)
nuill
d)
1
100 %
