Question # 1 of 10 ( Start time: 03:24:16 PM ) Total Marks: 1
Consider a complete binary tree, represented by the following array (array index starts at 1): 19, 7, 15, 6, 4, 13, 2, 3, 2 What will be values of the children of the node with value ‘15’? Left:________ Right:__________
Select correct option:
19,7
6,4
4,13
13,2
Question # 2 of 10 ( Start time: 03:25:47 PM ) Total Marks: 1
Which of the following method is helpful in creating the heap at once?
Select correct option:
insert
add
update
preculateDown
Question # 3 of 10 ( Start time: 03:26:48 PM ) Total Marks: 1
Suppose we have a Binary Search Tree with levels of node given below tell which one of the following is AVL tree also,
Select correct option:
1,0,0,1,-1,0,2,0,-2
1,0,-1,0,2,0,-2,0,0
1,1,-1,-1,0,-1,0,0,0
1,0,-1,-1,2,0,0,-1,0
Question # 4 of 10 ( Start time: 03:28:10 PM ) Total Marks: 1
For the inorder traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the ________ node of the tree.
Select correct option:
left most
root
right most
any of the given node
Question # 5 of 10 ( Start time: 03:29:35 PM ) Total Marks: 1
It is necessary for Huffman encoding tree to be,
Select correct option:
AVL Tree
Binary Tree
Complete Binary Tree
None of these
Question #6 of 10 ( Start time: 03:33:12 PM ) Total Marks: 1
Which of the following statement is correct?
Select correct option:
A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.
A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor. A Threaded Binary T
Question # 7 of 10 ( Start time: 03:34:06 PM ) Total Marks: 1
An expression tree will always be a,
Select correct option:
complete binary tree
binary search tree
Heap
AVL tree
Question # 8 of 10 ( Start time: 03:35:35 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: 03:36:37 PM ) Total Marks: 1
In which case of insertion we require double rotation to make the AVL tree balance.
Select correct option:
An insertion into left subtree of the left child of alpha.
An insertion into left subtree of the right child of alpha.
An insertion into right subtree of the right child of alpha.
None of the above.
Question # 10 of 10 ( Start time: 03:38:08 PM ) Total Marks: 1
If there are N internal nodes in a binary tree then what will be the no.of external nodes in this binary tree?
Select correct option:
N-1
N
N+1
N+2
