An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ
Posted: Wed Jul 13, 2022 7:42 pm
a) At least one
b) At most one
c) Two
d) At most two
b) At most one
c) Two
d) At most two