If N distinct keys are inserted into a Binary Search Tree in strictly increasing order, what type of tree is generally produced?

Options

  • A. Complete binary tree
  • B. Right-skewed tree
  • C. Perfect binary tree
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. Right-skewed tree

Detailed Explanation

If distinct keys are inserted into a BST in strictly increasing order, every new key is greater than the previous key. Therefore, each new node becomes the right child of the previous node, producing a right-skewed or degenerate tree. Such a tree has height approximately Nāˆ’1 and can make search, insertion and deletion take O(N), instead of the O(log N) expected from a well-balanced BST.

ā† Previous Next ā†’

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts