Question: is avl tree a complete binary tree?
Answer: NO. NO. AVL tree is a binary search tree with a condition the at every node in the tree the height difference left sub-tree and right sub-tree should no exceed by “ 1 ” . ... But complete binary tree does not care for values assigned to nodes , it only checks that at each level all the nodes are as left as possible.