Binary Trees
•A binary tree is a tree where each node
has no
more than 2 children.
–If we traverse down a binary tree --
for every node -- there are either no children (making this node a leaf)
or there are two children called the left and right subtrees
–(A subtree is a subset of a tree
including some node in the tree along with all of its descendants).