The preculateDown procedure will move the smallervalue____ and bigger value_____
ID: 3607804 • Letter: T
Question
The preculateDown procedure will move the smallervalue____ and bigger value______.
Select correct option:
left,right
right,left
up,down
down,up
There are _________cases of Rotation in AVLtree.
Select correct option:
2
3
4
5
.
A complete binary tree of height 3 has between ________nodes.
Select correct option:
8 to 14
8 to 15
8 to 16
8 to 17
In case of insertion of right inner node in BST,
Select correct option:
we need to apply single left rotation to make it AVL tree.
we need to apply single right rotationto make it AVL tree.
single left rotation first and then single right rotation tomake it AVL tree.
single right rotation first and then single left
Binary Search Tree voilates the condition of AVL tree when anynode has balance equal to
Select correct option:
2 or -2
1 or -1
0
None of the options.
Suppose we have the following values to be inserted inconstructing AVL tree, 20,23,25,10,12,13 Tell when first rotationwill take place,
Select correct option:
after inserting node 25
after inserting node 23
after inserting node 10
after inserting node 12
The preculateDown procedure will move the smallervalue____ and bigger value______.
Select correct option:
left,right
right,left
up,down
down,up
There are _________cases of Rotation in AVLtree.
Select correct option:
2
3
4
5
.
A complete binary tree of height 3 has between ________nodes.
Select correct option:
8 to 14
8 to 15
8 to 16
8 to 17
In case of insertion of right inner node in BST,
Select correct option:
we need to apply single left rotation to make it AVL tree.
we need to apply single right rotationto make it AVL tree.
single left rotation first and then single right rotation tomake it AVL tree.
single right rotation first and then single left
Binary Search Tree voilates the condition of AVL tree when anynode has balance equal to
Select correct option:
2 or -2
1 or -1
0
None of the options.
Suppose we have the following values to be inserted inconstructing AVL tree, 20,23,25,10,12,13 Tell when first rotationwill take place,
Select correct option:
after inserting node 25
after inserting node 23
after inserting node 10
after inserting node 12
Explanation / Answer
Dear...1.The preculateDown procedure will move the smallervalueleft, and bigger valueright 2.There are 4 cases of Rotation in AVLtree. 3.A complete binary tree of height 3 has between 8 to 15 nodes 4. Binary Search Tree voilates the condition of AVLtree when any node has balance equal to 2or -2 5.Suppose we have the following values to be insertedin constructing AVL tree, 20,23,25,10,12,13 Tell when firstrotation will take place, after inserting node 23 5.Suppose we have the following values to be insertedin constructing AVL tree, 20,23,25,10,12,13 Tell when firstrotation will take place, after inserting node 23
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.