COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is
|
|
W is an internal node
|
|
|
V is a leaf node
|
|
|
S is a root node
|
|
|
B is a leaf node
|
Explanation:
Detailed explanation-1: -The left and right subtrees of the root are binary search trees. In a BST, insertion is always at the leaf level.
Detailed explanation-2: -BST Deletion involves deleting a node from BST. BST Insertion involves inserting a node in BST. BST Search involves searching a node in BST.
Detailed explanation-3: -It displays the number of keys (N), the maximum number of nodes on a path from the root to a leaf (max), the average number of nodes on a path from the root to a leaf (avg), the average number of nodes on a path from the root to a leaf in a perfectly balanced BST (opt).
There is 1 question to complete.