Why does an AVL tree with N nodes maintain $C \leq N/2$?

392 Views Asked by At

If $C$ denotes the number of "only child" nodes (a node is called an only child when its parent is not null and it doesn't have a sibling), why do we have that for every AVL tree with $N$ nodes, $C \leq N/2$?