Function postOrder

Trees/binarytreetraversal.c:31–38

        }
  }
  void postOrder(struct tnode *node) {
        if (node) {
                postOrder(node->left);
                postOrder(node->right);
                printf("%d  ", node->data);
        }
        return;
  }


  void preOrder(struct tnode *node) {