An AVL tree is a self-balancing binary search tree where the _______ factor of each node is at most _______.

  • Balancing, 1
  • Degree, 2
  • Depth, 1
  • Height, 0
An AVL tree is a self-balancing binary search tree where the height factor (also known as the balance factor) of each node is at most 1. The balance factor is the difference between the height of the left and right subtrees.
Add your answer
Loading...

Leave a comment

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