Question # 1 of 10 ( Start time: 02:36:27 PM ) Total Marks: 1
If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
Select correct option
54
55
56
57
Question # 2 of 10 ( Start time: 02:37:26 PM ) Total Marks: 1
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ----------
Select correct option:
Complete Binary tree
Threaded binary tree
Expression tree
Perfectly complete Binary tree
Question # 3 of 10 ( Start time: 02:38:09 PM ) Total Marks: 1
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?
Select correct option:
15
16
31
32
Question # 4 of 10 ( Start time: 02:38:56 PM ) Total Marks: 1
By using __________we avoid the recursive method of traversing a Tree,which makes use of stacks and consumes a lot of memory and time.
Select correct option:
Binary tree only
Threaded binary tree
Heap data structure
Huffman encoding
Question # 5 of 10 ( Start time: 02:39:34 PM ) Total Marks: 1
Which of the following statement is NOT true about threaded binary tree?
Select correct option:
Right thread of the right-most node points to the dummy node.
Left thread of the left-most node points to the dummy node.
The left pointer of dummy node points to the root node of the tree.
Left thread of the right-most node points to the dummy node.
Question # 6 of 10 ( Start time: 02:40:24 PM ) Total Marks: 1
The total number of nodes on 5th level of a perfect binary tree are :
Select correct option:
16
15
31
32
Question # 7 of 10 ( Start time: 02:41:28 PM ) Total Marks: 1
We implement the heap by ______________ .
Select correct option:
Threaded Tree
AVL tree
Complete binary tree
Expression
Question # 8 of 10 ( Start time: 02:42:18 PM ) Total Marks: 1
While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.
Select correct option:
Equal to the small frequency
Equal to the greater
Equal to the sum of the two frequencies
Equal to the difference of the two frequencies
Question # 9 of 10 ( Start time: 02:43:03 PM ) Total Marks: 1
Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?
Select correct option:
4,6,7,5
6,7,5,4
4,5,6,7
4,6,5,7,
Question # 10 of 10 ( Start time: 02:43:36 PM ) Total Marks: 1
A tree is an AVL tree if
Select correct option:
Any one node fulfills the AVL condition
At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition
None of the given options
