Traverse the following binary tree in postorder.

Drag the keys into the list below in the requested traversal order.

Some additional problems.

void traversePostOrder(link t) {
        if (t != NULL) {
                traversePostOrder(t.getLeft());
                traversePostOrder(t.getRight());
		visit(t);
        }
}