WorksheetsBinary Search Tree (Recap 1)
Total questions: 13
Worksheet time: 13mins
A tree is composed of ____ connected by edges or lines.
a point
a leaf node
a root node
nodes
A type of node that is located on the topmost part of the tree is called a (a) .
A type of node that doesn't consist any children is called a (a) .
Select the statement(s) that is/are TRUE about a binary search tree?
Each parent node has a maximum of two child nodes.
The value in a left child node is less than the value in the parent node.
The value in the right child node is greater than the value in the parent node.
Is this a Binary Search Tree?
Yes
No
Could this be a Binary Search Tree?
What is the order of complexity for traversal?
Yes, O(log(n))
No, O(n)
Yes, O(n)
No, O(log(n))
Which of one these trees is a Binary Search Tree?
In a Binary Search Tree, when adding a node with the same value as its root, where would the node be inserted?
Left
Right
Depends on the implementation
No such scenario
Which figure below represents the binary search tree of the following values: { 18, 6, 12, 22, 25, 30, 20, 2 }
Which figure below represents the binary search tree of the following values:{ 20, 30, 18, 22, 25, 6, 2 }
How many steps will it take to find 27 in the given binary search tree?
1
2
3
4
What is the MAXIMUM number of nodes in a binary search tree of height = 5 ?
26-1
25-1
25
26
6
What is the MINIMUM number of nodes in a binary search tree of height = 5?
6
5
26-1
25-1
25
