Binary Tree

1 2 Each node has at most two children, k-ary tree with k=2;

Balanced Binary Tree

Height-Balanced mean that the depth of two subtrees of every node never differ by more than one.