Question : In a Pre-order traversal, the root node is visited:
Solution :
Correct Answer : First
Description -
Question : In an In-order traversal, nodes are visited in:
Solution :
Correct Answer : Left → Root → Right
Description -
Question : Post-order traversal follows:
Solution :
Correct Answer : Left → Right → Root
Description -
Question : In a BST, all values in the left subtree are:
Solution :
Correct Answer : Less than root
Description -
Question : In-order traversal of a BST produces:
Solution :
Correct Answer : Sorted order
Description -
Question : Time complexity of searching in a balanced BST is:
Solution :
Correct Answer : O(log n)
Description -
Question : Which traversal is used to copy a tree?
Solution :
Correct Answer : Pre-order
Description -
Question : Which traversal deletes a tree safely?
Solution :
Correct Answer : Post-order
Description -
Question : Root of the following tree is visited last in:
Solution :
Correct Answer : Post-order
Description -
Question : Maximum nodes at level k of a binary tree:
Solution :
Correct Answer : 2ᵏ
Description -
Question : Searching key 50 in BST starts from:
Solution :
Correct Answer : Root node
Description -
Question : BST insertion always occurs at:
Solution :
Correct Answer : Leaf position
Description -
Question : Deleting a leaf node from BST requires:
Solution :
Correct Answer : No replacement
Description -
Question : Node with one child is deleted by:
Solution :
Correct Answer : Replacing with child
Description -
Question : Deletion of node with two children uses:
Solution :
Correct Answer : In-order successor/predecessor
Description -
Question : Worst-case search complexity in BST:
Solution :
Correct Answer : O(n)
Description -
Question : A skewed BST behaves like:
Solution :
Correct Answer : Linked List
Description -
Question : Which node replaces a deleted node having two children?
Solution :
Correct Answer : Successor/Predecessor
Description -
Question : AVL Tree is:
Solution :
Correct Answer : Balanced BST
Description -
Question : AVL stands for:
Solution :
Correct Answer : Adelson-Velsky and Landis
Description -
Question : Balance Factor of AVL node is:
Solution :
Correct Answer : Left Height − Right Height
Description -
Question : Allowed balance factor values are:
Solution :
Correct Answer : -1, 0, +1
Description -
Question : Inserting 30,20,10 causes:
Solution :
Correct Answer : LL Rotation
Description -
Question : LL imbalance is corrected using:
Solution :
Correct Answer : Right Rotation
Description -
Question : Inserting 10,20,30 causes:
Solution :
Correct Answer : RR
Description -
Question : RR imbalance is corrected using:
Solution :
Correct Answer : Left Rotation
Description -
Question : Inserting 30,10,20 causes:
Solution :
Correct Answer : LR
Description -
Question : LR Rotation requires:
Solution :
Correct Answer : Left then Right Rotation
Description -
Question : Inserting 10,30,20 causes:
Solution :
Correct Answer : RL
Description -
Question : RL Rotation requires:
Solution :
Correct Answer : Right Rotation then Left Rotation
Description -