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:
Getting the Size of an Iterable in Java
Java Program to Implement Ford–Fulkerson Algorithm
What is a POJO Class?
Chuyển đổi giữa các kiểu dữ liệu trong Java
Java Program to Implement Interpolation Search Algorithm
Java 14 Record Keyword
Java Program to Perform Addition Operation Using Bitwise Operators
Java Program to Implement Fibonacci Heap
Java TreeMap vs HashMap
Java Program to Implement Self organizing List
Java Program to Check if a Matrix is Invertible
Guide to the Fork/Join Framework in Java
Java Program to Perform Encoding of a Message Using Matrix Multiplication
A Guide to the Java ExecutorService
Deploy a Spring Boot App to Azure
Guide to ThreadLocalRandom in Java
Giới thiệu Google Guice – Binding
Giới thiệu Design Patterns
Check if a String is a Palindrome in Java
Lớp Collections trong Java (Collections Utility Class)
Retrieve User Information in Spring Security
Spring REST API + OAuth2 + Angular
Collect a Java Stream to an Immutable Collection
How to Set TLS Version in Apache HttpClient
HashSet trong java
Java Web Services – Jersey JAX-RS – REST và sử dụng REST API testing tools với Postman
Java Program to Implement Knight’s Tour Problem
Hướng dẫn Java Design Pattern – Interpreter
Java Program to Find a Good Feedback Vertex Set
Apache Commons Collections OrderedMap
Java Program to Implement Stack
Java Program to Implement Hash Tree