Reading material
Pages 132-133, 137-138 and 144-151.
Additional material
A binary tree is an ordered tree in which each node has
- no children,
- a left child,
- a right child, or
- both a left child and a right child.
A strong binary tree is an ordered tree in which each node has
- no children or
- both a left child and a right child.
Sequence.java
RankedSequenceException.java
PositionalSequenceException.java
Tree.java
TreeException.java
BinaryTree.java
java.util.Vector
java.util.Enumeration