Which balancing technique is commonly used in binary search trees to ensure their height is minimized?

  • Mirroring
  • Pruning
  • Rotation
  • Shuffling
Rotation is a common balancing technique used in binary search trees. It involves reorganizing the nodes in the tree to maintain balance, ensuring that the height of the tree is minimized, and search operations remain efficient.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *