master
..
rw-r--r--
680 B
rw-r--r--
275 B
rw-r--r--
3.4 KB
rw-r--r--
442 B
rw-r--r--
6.3 KB
rw-r--r--
920 B
rw-r--r--
897 B
rw-r--r--
260 B
rw-r--r--
1.7 KB

Create a subclass of BinaryTree whose nodes have fields for storing preorder, post-order, and in-order numbers. Write methods preOrderNumber(), inOrderNumber(), and postOrderNumbers() that assign these numbers correctly. These methods should each run in O(n) time.