The second item of list when traverse the tree with preorder is item:
A -
E
B -
B
C -
C
D -
H
2-
The following items are inserted into a binary search tree: 3, 6, 5, 2, 4, 7, 1.
Which node is the deepest?
A -
4
B -
3
C -
1
D -
7
3-
The operation for adding an entry to a stack is traditionally called:
A -
append
B -
add
C -
insert
D -
push
4-
The tree in picture is traversed using preorder traversal, and each time a node is visited,
the label for that node is printed. Which of the following would be the resulting output?
A -
a b c * +
B -
a* + b c
C -
+ * a b c
D -
+ a * b c
5-
The following items are inserted into a AVL tree: 10, 5, 8, 12 Which item is placed at a
root?
A -
5
B -
12
C -
8
D -
10
6-
The following items are inserted into a AVL tree: 5, 8, 10, 12 Which item is placed at a
root?
A -
5
B -
12
C -
10
D -
8
7-
The minimem height of a binary search tree containing n nodes is:
A -
(int) log2 (n)
B -
n
C -
n - 1
D -
no. levels + 1
8-
The following items are inserted into a AVL tree: 10, 2, 4, 6, 8 Which item is placed at
a root?
A -
4
B -
2
C -
8
D -
10
9-
This function use to find max in 3 integers a,b,c
int findMax(int a, int b, int c)
{
int temp;
if (a>b)
temp=a;
else
temp=b;
if (c>______)
temp=c;
return temp;
}
The missing word is:
A -
temp
B -
a
C -
0
D -
b
10-
The isFull ( ) member method is called within the enque process to determine
A -
if there is an item queue to be removed
B -
if there is an item in the queue to be locked
C -
if there is room to place another item in the queue
