Question : What is a Tree in Data Structure?
Solution :
Correct Answer : Non-linear hierarchical structure
Description -
Question : Which node is at the top of a tree?
Solution :
Correct Answer : Root Node
Description -
Question : In a Binary Tree, a node can have at most:
Solution :
Correct Answer : 2 children
Description -
Question : Number of edges in a tree having n nodes:
Solution :
Correct Answer : n−1
Description -
Question : A node with no children is called:
Solution :
Correct Answer : Leaf Node
Description -
Question : Maximum number of nodes at level k in a binary tree:
Solution :
Correct Answer : 2ᵏ
Description -
Question : Inorder traversal follows:
Solution :
Correct Answer : Left-Root-Right
Description -
Question : Preorder traversal follows:
Solution :
Correct Answer : Root-Left-Right
Description -
Question : Postorder traversal follows:
Solution :
Correct Answer : Left-Right-Root
Description -
Question : Which traversal gives sorted output in BST?
Solution :
Correct Answer : Inorder
Description -
Question : BST property:
Solution :
Correct Answer : Left < Root < Right
Description -
Question : Search complexity in balanced BST:
Solution :
Correct Answer : O(log n)
Description -
Question : Worst-case search complexity in BST:
Solution :
Correct Answer : O(n)
Description -
Question : Which traversal is used to delete a tree?
Solution :
Correct Answer : Postorder
Description -
Question : AVL tree is:
Solution :
Correct Answer : Self-balancing BST
Description -
Question : Balance Factor of AVL Tree is:
Solution :
Correct Answer : Height(left) − Height(right)
Description -
Question : Allowed balance factor values in AVL Tree:
Solution :
Correct Answer : {-1,0,1}
Description -
Question : LL imbalance is fixed using:
Solution :
Correct Answer : Right Rotation
Description -
Question : RR imbalance is fixed using:
Solution :
Correct Answer : Left Rotation
Description -
Question : LR imbalance requires:
Solution :
Correct Answer : Left then Right Rotation
Description -
Question : B-Tree is mainly used in:
Solution :
Correct Answer : Database Indexing
Description -
Question : B-Tree is:
Solution :
Correct Answer : Multiway Search Tree
Description -
Question : All leaves in B-Tree are:
Solution :
Correct Answer : At same level
Description -
Question : Height of B-Tree grows:
Solution :
Correct Answer : Logarithmically
Description -
Question : In B+ Tree, actual records are stored in:
Solution :
Correct Answer : Leaf Nodes
Description -
Question : Leaf nodes in B+ Tree are:
Solution :
Correct Answer : Linked Together
Description -
Question : Red-Black Tree is:
Solution :
Correct Answer : Self-balancing BST
Description -
Question : Root node of Red-Black Tree is always:
Solution :
Correct Answer : Black
Description -
Question : AA Tree is a simplified version of:
Solution :
Correct Answer : Red-Black Tree
Description -
Question : AA Tree uses which balancing operations?
Solution :
Correct Answer : Skew and Split
Description -