Binary Tree (ADT)

The binary tree ADT extends the Tree (ADT). It has additional methods:

• position left(v): return the left child of $v$
• position right(v): return the right child of $v$
• boolean hasLeft(v): test whether $v$ has a left child
• boolean hasRight(v): test whether $v$ has a right child