w3resource

Java: Get the Postorder traversal of its nodes' values of a given a binary tree

Java Basic: Exercise-127 with Solution

Write a Java program to get the Postorder traversal of its nodes' values in a binary tree.

Sample Binary Tree

Java Basic Exercises: Sample Binary Tree.

Postorder Traversal:

Java Basic Exercises: Get the Postorder traversal of its nodes' values of a given a binary tree.

Sample Solution:

Java Code:

class Node
{
    int key;
    Node left, right;

    public Node(int item)
    {
        // Constructor to create a new Node with the given item
        key = item;
        left = right = null;
    }
}

class BinaryTree
{
  // Root of Binary Tree
    Node root;

    BinaryTree()
    {
        // Constructor to create an empty binary tree
        root = null;
    }

 void print_Postorder(Node node)
    {
        if (node == null)
            return;

        // Recursively print the left subtree in postorder
        print_Postorder(node.left);

        // Recursively print the right subtree in postorder
        print_Postorder(node.right);

        // Print the key of the current node
        System.out.print(node.key + " ");
    }

 void print_Postorder()  
	{   
	   // Wrapper method to start printing the tree in postorder
	   print_Postorder(root);  
	}
        public static void main(String[] args)
    {
       BinaryTree tree = new BinaryTree();

        // Create a binary tree with nodes and keys
        tree.root = new Node(55);
        tree.root.left = new Node(21);
        tree.root.right = new Node(80);
        tree.root.left.left = new Node(9);
        tree.root.left.right = new Node(29);
        tree.root.right.left = new Node(76);
        tree.root.right.right = new Node(91);

        // Display a message and initiate the postorder traversal
        System.out.println("\nPostorder traversal of binary tree is: ");
        tree.print_Postorder();
    }
}

Sample Output:

Postorder traversal of binary tree is: 
9 29 21 76 91 80 55  

Flowchart:

Flowchart: Java exercises: Get the Postorder traversal of its nodes' values of a given a binary tree.

Java Code Editor:

Previous: Write a Java program to get the inorder traversal of its nodes' values of a given a binary tree.
Next: Write a Java program to calculate the median of unsorted array of integers, find the median of it.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://www.w3resource.com/java-exercises/basic/java-basic-exercise-127.php