We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Postorder Traversal
  5. Discussions

Tree: Postorder Traversal

  • Tolani
     + 0 comments

    To be honest you don't need the second if statement if(root!= null) . The base case is can be seen as a else construct. I don't program in java but in C++ it looks like this

    void postOrder(node *root) {

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

    I guess in java, it would be 

    void Postorder(Node root) {
if(root == null)
    {
    return;
    }
     Postorder(root.left);
     Postorder(root.right);
     System.out.print(root.data+" ");
}