Traversing a tree using Postorder traveral recursively

package in.blogspot.arunj2ee.ds.tree.traversal;

import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode;
import in.blogspot.arunj2ee.ds.tree.util.TreeUtil;

/**
 * Traversing a tree using Postorder traveral recursively
 * Postorder ==> Left,Right,Node
 * Time Complexity: O(n), Space Complexity: O(n)
 * @author Arun.Singh
 *
 */
public class PostOrderTraversalRecursion {
public static void postOrderTraversal(BinaryTreeNode root) {
if (root != null) {
postOrderTraversal(root.getLeft());
postOrderTraversal(root.getRight());
System.out.print(root.getData());
}
}

public static void main(String[] args) {
postOrderTraversal(TreeUtil.makeSampleBinaryTree());
}

}

========================================================================

Refer Core Classes: http://arunj2ee.blogspot.in/2017/05/tree-core-and-utility-classes.html

========================================================================

Share on Google Plus

About Admin

Arun is a JAVA/J2EE developer and passionate about coding and managing technical team.