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:
Hướng dẫn Java Design Pattern – Observer
Java Program to Implement Radix Sort
Logging a Reactive Sequence
Java Program to Perform Searching Using Self-Organizing Lists
Create Java Applet to Simulate Any Sorting Technique
Hướng dẫn Java Design Pattern – Template Method
Receive email using IMAP
Java Program to Implement RoleList API
@Order in Spring
Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon
Java Program to Implement Graph Coloring Algorithm
Kết hợp Java Reflection và Java Annotations
Spring Data JPA @Modifying Annotation
Java Program to Represent Graph Using Linked List
Shuffling Collections In Java
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Implement Self Balancing Binary Search Tree
Java Program to Implement Binary Heap
Primitive Type Streams in Java 8
Servlet 3 Async Support with Spring MVC and Spring Security
Spring AMQP in Reactive Applications
Java Copy Constructor
Receive email using POP3
Number Formatting in Java
Spring Cloud – Bootstrapping
Java Program to Implement HashSet API
Login For a Spring Web App – Error Handling and Localization
Java Program to Implement Dijkstra’s Algorithm using Set
Từ khóa throw và throws trong Java
LinkedList trong java
Java Program to Implement Sorted Doubly Linked List
Spring WebClient and OAuth2 Support