Poll Results
No votes. Be the first one to vote.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
No votes. Be the first one to vote.
The type of tree where, for every node, the height of its left subtree and right subtree differ by at most one is called an AVL tree. AVL trees are a type of self-balancing binary search tree that maintain this balance criterion to ensure O(log n) time complexity for operations such as insertion, deletion, and search, where n is the number of nodes in the tree.
B. avl tree