Q. An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub treesof any node differ by (Solved)
1. At least one
2. At most one
3. Two
4. At most two
- b. At most one
1. At least one
2. At most one
3. Two
4. At most two