Binary tree postal service lodge traversal inwards Java alongside example

In in conclusion duet of articles, nosotros receive got learned most pre-order in addition to in-order tree traversal inwards Java in addition to today, you lot volition larn most the postal service lodge traversal inwards binary tree. The post lodge traversal is likewise a depth-first algorithm because you lot acquire deep before you lot see other nodes inwards same level. In postal service lodge traversal, you lot get-go see left subtree, hence correct subtree in addition to finally you lot impress the value of node or root. That's why the value of source is e'er printed in conclusion on postal service lodge traversal. Like many tree algorithms, the easiest agency to implement post-order traversal is past times using recursion. In fact, if you lot know how to write pre-order using recursion, you lot tin give the axe purpose the same algorithm amongst fighting of adjustment to implement postal service lodge traversal. All you lot need to exercise is instead of printing the value of node first, only telephone telephone the recursive method amongst left subtree every bit shown inwards our example.

Unlike in-order traversal which prints all nodes of binary search tree inwards sorted order, post-order doesn't render sorting but its useful spell deleting nodes from binary tree, meet a skillful mass on information construction in addition to algorithms e.g. Introduction to Algorithms past times Thomas H. Cormen to larn to a greater extent than most dissimilar usage of post-order traversal inwards Computer Science in addition to programming.

Post-order traversal using Recursion

The recursive algorithm is real slow to empathise every bit it precisely similar to the recursive preOrder in addition to recursive inOrder traversal. The exclusively matter which is dissimilar is the lodge inwards which the left subtree, correct subtree, in addition to source are visited or traversed every bit shown inwards next code snippet.

private void postOrder(TreeNode node) {     if (node == null) {       return;     }      postOrder(node.left);     postOrder(node.right);     System.out.printf("%s ", node.data);   }

You tin give the axe meet that algorithm is precisely similar to pre-order algorithm except for the order of traversal to root, left sub-tree, in addition to correct subtree is different. In this code, left subtree is visited first, the correct subtree is visited minute in addition to value of the node is printed third.

If you lot desire to larn to a greater extent than most the recursive post-order traversal algorithm e.g. it's existent globe examples in addition to complexity assesment, I advise you lot to accept a expect at Algorithms fourth Edition past times Robert Sedgewick, 1 of the best information construction in addition to algorithm mass for Java developers every bit examples are given inwards Java programming language.

you lot volition larn most the postal service lodge traversal inwards binary tree Binary tree postal service lodge traversal inwards Java amongst example

Java Program to impress binary tree inwards post-order traversal

Here is the consummate Java programme to impress all nodes of a binary tree inwards the postal service lodge traversal. In this business office of the tutorial, nosotros are learning the recursive postal service lodge traversal in addition to side past times side part, I'll present you lot how to implement postal service lodge algorithm without recursion, 1 of the toughest tree traversal algorithm for beginner programmers.

Similar to our before examples, I receive got created a degree called BinaryTree to stand upwards for a binary tree inwards Java. This degree has a static nested class to stand upwards for a tree node, called TreeNode. This is similar to the Map.Entry degree which is used to stand upwards for an entry inwards the hash table. The degree only maintain the reference to source in addition to TreeNode takes attention of left in addition to correct children.

This degree has ii methods postOrder() in addition to postOrder(TreeNode root), the get-go 1 is populace in addition to minute 1 is private. The actual traversing is done inwards minute method but since root is internal to the degree in addition to customer don't receive got access to root, I receive got created postOrder() method which calls the someone method. This is a mutual play a joke on to implement recursive algorithm.

This likewise gives you lot luxury to alter your algorithm without affecting clients e.g. tomorrow nosotros tin give the axe alter the recursive algorithm to an iterative 1 in addition to customer volition yet hold out calling the postal service lodge method without knowing that at 1 time iterative algorithm is inwards place.

Here is the binary tree which you lot need to traverse inwards the postal service order, the work is solved past times next event every bit well:

Printing nodes of binary tree inwards postal service order

import java.util.Stack;  /*  * Java Program to traverse a binary tree   * using postOrder traversal without recursion.   * In postOrder traversal get-go left subtree is visited, followed past times correct subtree  * in addition to finally information of source or electrical flow node is printed.  *   * input:  *     55  *    /  \  *   35   65  *   / \    \  *  25  45   75  *  /  /  \  * xv 87  98  *   * output: xv 25 45 35 87 98 75 65 55   */  public class Main {    public static void main(String[] args) throws Exception {      // laid the binary tree given inwards question     BinaryTree bt = BinaryTree.create();      // traversing binary tree using post-order traversal using recursion     System.out.println("printing nodes of a binary tree on postal service lodge inwards Java");      bt.postOrder();    }  }  class BinaryTree {   static class TreeNode {     String data;     TreeNode left, right;      TreeNode(String value) {       this.data = value;       left = right = null;     }      boolean isLeaf() {       return left == null ? right == null : false;     }    }    // source of binary tree   TreeNode root;    /**    * traverse the binary tree on postal service lodge traversal algorithm    */   public void postOrder() {     postOrder(root);   }    private void postOrder(TreeNode node) {     if (node == null) {       return;     }      postOrder(node.left);     postOrder(node.right);     System.out.printf("%s ", node.data);   }    /**    * Java method to exercise binary tree amongst essay information    *     * @return a sample binary tree for testing    */   public static BinaryTree create() {     BinaryTree tree = new BinaryTree();     TreeNode source = new TreeNode("55");     tree.root = root;     tree.root.left = new TreeNode("35");     tree.root.left.left = new TreeNode("25");     tree.root.left.left.left = new TreeNode("15");      tree.root.left.right = new TreeNode("45");     tree.root.right = new TreeNode("65");     tree.root.right.right = new TreeNode("75");     tree.root.right.right.left = new TreeNode("87");     tree.root.right.right.right = new TreeNode("98");      return tree;   }  }  Output printing nodes of a binary tree on postal service lodge in Java xv 25 87 98 45 35 75 65 55

That's all most how to implement postal service lodge traversal inwards Java. You tin give the axe purpose this algorithm to impress all nodes of binary tree inwards postal service order. Just retrieve that inwards postal service lodge traversal, you lot get-go see left subtree, followed past times correct subtree in addition to finally value of node or source is printed.

This is likewise the argue why source is printed at in conclusion on postal service lodge traversal. If you lot desire to larn to a greater extent than most postal service lodge traversal or other binary tree algorithms, I advise reading either Introduction to Algorithms by Thomas H. Cormen or Algorithms fourth Edition past times Robert Sedgewick, both are bang-up books to larn Data construction in addition to Algorithms.

Further Learning
Algorithms in addition to Data Structures - Part 1 in addition to 2
Java Fundamentals, Part 1 in addition to 2
Cracking the Coding Interview - 189 Questions in addition to Solutions

Other Binary tree tutorials in Java, you may similar to explore

Top v information construction in addition to algorithm books for coding interviews (list)
How to implement pre-order traversal inwards Java? (solution)
Java Program to traverse binary tree inwards pre-order without recursion (program)
How to implement in-order traversal inwards Java? (solution)
How to implement in-order traversal inwards Java without recursion? (solution)
How to impress all leafage nodes of a binary tree inwards Java? (solution)
Java Program to impress leafage nodes of binary tree without recursion? (program)
How to traverse a binary tree inwards pre-order without using recursion? (solution)
How to impress all leafage nodes of a binary tree without recursion inwards Java? (solution)
How to implement linked listing using generic inwards Java? (solution)
How to opposite a singly linked listing inwards Java? (solution)
How to uncovering the 3rd chemical constituent from the halt of linked listing inwards Java? (solution)
How to uncovering the middle chemical constituent of linked listing using unmarried pass? (solution)
Java programme to implement binary search using recursion? (solution)
How to opposite an array inwards house inwards Java? (solution)
How to impress duplicate elements of an array inwards Java? (solution)