Which of the following is a self-balancing binary search tree?

Options

  • A. AVL Tree
  • B. Stack
  • C. Queue
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. AVL Tree

Detailed Explanation

An AVL tree is a self-balancing Binary Search Tree. It maintains a balance condition after insertions and deletions so that the height difference between the left and right subtrees of every node is at most one. When an operation causes an imbalance, the tree uses rotations to restore its balance. Another important self-balancing BST is the Red-Black Tree. Both help maintain efficient logarithmic-time operations.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts