HW #4  COSC 311   DUE 2/12

 The recursive pseudo-code to traverse a binary tree in in-order is:


void inOrder(tree) {
   if (tree == null) return;
   inOrder( tree.left );
   visit(tree.data );       // 'visit' can mean e.g., 'output'
   inOrder (tree.right );
   }

1. Give the recursive pseudo-code for post-order traversal of a binary tree.


2. Give the recursive pseudo-code for pre-order traversal of a binary tree.     



3. Consider this multi-way tree:

              A
           /  |  \
        /     |     \
     /        |         \
    B         C           E
  / | \       |          /  \
  F G H       I          P   Q
                        /
                        R
                      /  |
                     S   T


Give the first-child / next-sibling representation.