Traverse the following binary tree in inorder.
Drag the keys into the list below in the requested traversal order.
Some additional problems.
void traverseInOrder(link t) { if (t != NULL) { traverseInOrder(t.getLeft()); visit(t); traverseInOrder(t.getRight()); } }