AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. - Study24x7
Social learning Network
26 Mar 2019 10:07 AM study24x7 study24x7

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles