This is a java program to construct a binary tree and perform postorder traversal of the constructed binary tree.
Nodes visited are in the order:
visit Left node
visit Right node
visit Root node
Here is the source code of the Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to implement recursive postorder traversal of the Binary Search Tree import java.util.Scanner; class BinarySearchTreeNodes { BinarySearchTreeNodes left, right; int data; public BinarySearchTreeNodes() { left = null; right = null; data = 0; } public BinarySearchTreeNodes(int n) { left = null; right = null; data = n; } public void setLeft(BinarySearchTreeNodes n) { left = n; } public void setRight(BinarySearchTreeNodes n) { right = n; } public BinarySearchTreeNodes getLeft() { return left; } public BinarySearchTreeNodes getRight() { return right; } public void setData(int d) { data = d; } public int getData() { return data; } } class BinarySearchTree { private BinarySearchTreeNodes root; public BinarySearchTree() { root = null; } public boolean isEmpty() { return root == null; } public void insert(int data) { root = insert(root, data); } private BinarySearchTreeNodes insert(BinarySearchTreeNodes node, int data) { if (node == null) node = new BinarySearchTreeNodes(data); else { if (data <= node.getData()) node.left = insert(node.left, data); else node.right = insert(node.right, data); } return node; } public void postorder() { postorder(root); } private void postorder(BinarySearchTreeNodes r) { if (r != null) { postorder(r.getLeft()); postorder(r.getRight()); System.out.print(r.getData() + " "); } } } public class Postorder_Recursive_BST { public static void main(String[] args) { Scanner scan = new Scanner(System.in); BinarySearchTree bst = new BinarySearchTree(); System.out.println("Enter the first 10 elements of the tree\n"); int N = 10; for (int i = 0; i < N; i++) bst.insert(scan.nextInt()); System.out.print("\nPost order : "); bst.postorder(); scan.close(); } }
Output:
$ javac Postorder_Recursive_BST.java $ java Postorder_Recursive_BST Enter the first 10 elements of the tree 12 10 11 03 15 19 02 01 04 70 Post order : 1 2 4 3 11 10 70 19 15 12
Related posts:
Filtering a Stream of Optionals in Java
Sắp xếp trong Java 8
Java Program to Find Transpose of a Graph Matrix
Java 8 and Infinite Streams
Reactive WebSockets with Spring 5
Tính trừu tượng (Abstraction) trong Java
Java TreeMap vs HashMap
Vòng lặp for, while, do-while trong Java
A Guide to Java 9 Modularity
Convert String to Byte Array and Reverse in Java
Hashing a Password in Java
Serverless Functions with Spring Cloud Function
Java Program to Implement Suffix Array
Introduction to Spring Method Security
Transactions with Spring and JPA
Java Program to Check whether Graph is Biconnected
Java Program to Perform String Matching Using String Library
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
Logging a Reactive Sequence
Jackson – Bidirectional Relationships
Using Spring ResponseEntity to Manipulate the HTTP Response
Quick Guide to the Java StringTokenizer
Spring Boot - Service Components
Java Program to Implement Aho-Corasick Algorithm for String Matching
Java Program to Convert a Decimal Number to Binary Number using Stacks
Immutable ArrayList in Java
Java Program to Implement Brent Cycle Algorithm
Java Program to Compute DFT Coefficients Directly
Concrete Class in Java
Spring Boot - Eureka Server
Introduction to Java 8 Streams
Rate Limiting in Spring Cloud Netflix Zuul