Sample of a "full" balanced binary tree showing order of nodes 16 / \ / \ / \ / \ / \ 08 24 / \ / \ / \ / \ / \ / \ 04 12 20 28 / \ / \ / \ / \ / \ / \ / \ / \ 02 06 10 14 18 22 26 30 / \ / \ / \ / \ / \ / \ / \ / \ 01 03 05 07 09 11 13 15 17 19 21 23 25 27 29 31 Note: that the "value" of each node increases from left to right across the page due to the way the tree is drawn. Sample of an unbalanced binary tree showing order of nodes 05 / / / / / 04 / / / 03 / / 02 / 01 Note: unused branches have a LEFT or RIGHT pointer that is null Sample of an unbalanced binary tree showing order of nodes 01 \ \ \ \ \ 02 \ \ \ 03 \ \ 04 \ 05