Tree: Postorder Traversal

  • + 0 comments

    void postOrder(Node* root) { if (root == NULL) return; postOrder(root->left); postOrder(root->right); cout << root->data << " "; }