Question

Difference between complete binary tree and avl tree

Answer 1

Every complete binary tree is an AVl tree, but not necessarily the other way around.

A complete binary tree is one where every layer except possibly the last is completely filled in. An AVL tree is one where every node's children are AVL trees whose heights differ by at most one. The maximally skewed AVL trees are the Fibonacci trees, which generally aren't complete trees. Here's an example of a tree that's an AVL tree and not a complete binary tree