Q1 Which of the following statement is true about dummy node ofthreaded binary t

Question

Q1
Which of the following statement is true about dummy node ofthreaded binary tree?
Select correct option:

The left pointer of dummy node points to the itself while theright pointer points to the root of tree.
The left pointer of dummy node points to the root node of thetree while the right pointer points itself i.e. to dummy node.
The left pointer of dummy node points to the root node of thetree while the right pointer is always NULL.
The right pointer of dummy node points to the itself whilethe left pointer is always NULL.

Q2
The smallest value element in a binary tree( Each node with leftand right pointers)lies at
Select correct option:

Root Node
Left Child of Root
Right Most Node
Left Most Node

Q3
In case of insertion of left outer node in BST,
Select correct option:

we apply single right rotation to make it AVL Tree.
we apply single left rotation to make it AVL Tree.
we first apply right rotation and then left rotation to makeit AVL Tree.
we first apply left rotation and then right rotation to makeit AVL Tree.

Q4
The depth of a binary tree is
Select correct option:

Total number of nodes in the tree
Number of leaf nodes in the tree
Number of non-leaf nodes in the tree
Maximum level of a leaf

Q5
Which of the following operation is NOT a ‘one step’operation of linked list?

Select correctoption:
add
remove
find
next

Q6
Consider a min heap, represented by the following array:10,30,20,70,40,50,80,60 After inserting a node with value 31.Whichof the following is the updated min heap?
Select correct option:

10,30,20,31,40,50,80,60,70
10,30,20,70,40,50,80,60,31
10,31,20,30,40,50,80,60,31
31,10,30,20,70,40,50,80,60

Q7
Which of the following is a correct statement?
Select correct option:

An AVL tree is identical to a BST except height of the leftand right subtrees can differ by at most 1.
An AVL tree is identical to a BST except height of the leftand right subtrees can differ by at least 1.
An AVL tree is identical to a BST except height of the leftand right subtrees must differ by at least 1.
An AVL tree is not identical to a BST, its altogether kind oftree.

Q8
In threaded binary tree the NULL pointers are replaced bythe
Select correct option:

preorder successor or predecessor
inorder successor or predecessor
inorder successor or predecessor
NULL pointers are not replaced


Q9
The statement "The insertion operation in avl tree, generallytake's more time than insertion operation in simple binary searchtree" is
Select correct option:

Always correct
Is always incorrect
Can be correct is some cases only
None of these.

Q10
Suppose we have the following values to be inserted in constructingAVL tree, 20,23,25,10,12,13 Tell when first rotation will takeplace,
Select correct option:

after inserting node 25
after inserting node 23
after inserting node 10
after inserting node 12

Explanation / Answer

(2)    Left Child of Root

(3)   

(4)    Maximum level of a leaf

(5)    Add

(6)    10,30,20,31,40,50,80,60,70

(7)    An AVL tree is identical to a BST exceptheight of the left and right subtrees can differ by at most1.

(8)    inorder successor or predecessor

(9)    Always correct

(10)after inserting node 25

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.