This is a java program to construct a binary tree and perform preorder traversal of the constructed binary tree.
Nodes visited are in the order:
visit Root node
visit Left node
visit Right node
Here is the source code of the Java Program to Perform Preorder Non-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 non recursive pre-order traversal of Binary Search Tree import java.util.Scanner; import java.util.Stack; class BinarySearchTreeNode { BinarySearchTreeNode left, right; int data; public BinarySearchTreeNode() { left = null; right = null; data = 0; } public BinarySearchTreeNode(int n) { left = null; right = null; data = n; } public void setLeft(BinarySearchTreeNode n) { left = n; } public void setRight(BinarySearchTreeNode n) { right = n; } public BinarySearchTreeNode getLeft() { return left; } public BinarySearchTreeNode getRight() { return right; } public void setData(int d) { data = d; } public int getData() { return data; } } class BinarySearchTreeOperations { private BinarySearchTreeNodes root; public BinarySearchTreeOperations() { 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 preorder() { preorder(root); } private void preorder(BinarySearchTreeNodes r) { Stack<BinarySearchTreeNodes> s = new Stack<BinarySearchTreeNodes>(); s.push(r); while (!s.empty()) { r = s.pop(); System.out.print(r.data + " "); if (r.right != null) s.push(r.right); if (r.left != null) s.push(r.left); } } } public class Preorder_NonRecursive_BST { public static void main(String[] args) { Scanner scan = new Scanner(System.in); BinarySearchTreeOperations bst = new BinarySearchTreeOperations(); 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("\nPre order : "); bst.preorder(); scan.close(); } }
Output:
$ javac Preorder_NonRecursive_BST.java $ java Preorder_NonRecursive_BST Enter the first 10 elements of the tree 12 4 10 13 15 46 78 98 45 12 Pre order : 12 4 10 12 13 15 46 45 78 98
Related posts:
Concurrent Test Execution in Spring 5
Java String to InputStream
OAuth2 Remember Me with Refresh Token
Truyền giá trị và tham chiếu trong java
Vấn đề Nhà sản xuất (Producer) – Người tiêu dùng (Consumer) và đồng bộ hóa các luồng trong Java
Spring’s RequestBody and ResponseBody Annotations
Converting a Stack Trace to a String in Java
Java Program to Implement Max Heap
Java Map With Case-Insensitive Keys
Java Program to Perform Complex Number Multiplication
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Java Program to Implement Ternary Tree
More Jackson Annotations
Daemon Threads in Java
Simple Single Sign-On with Spring Security OAuth2
Convert Hex to ASCII in Java
The “final” Keyword in Java
Java Program to Implement Disjoint Set Data Structure
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Java Program to subtract two large numbers using Linked Lists
Java Program to Implement Johnson’s Algorithm
Removing Elements from Java Collections
Hướng dẫn sử dụng Lớp FilePermission trong java
Notify User of Login From New Device or Location
Java Program to Generate Randomized Sequence of Given Range of Numbers
Java Program to Implement the Hill Cypher
A Guide to the Java ExecutorService
Spring Boot: Customize the Jackson ObjectMapper
Java Program to Print only Odd Numbered Levels of a Tree
Introduction to Netflix Archaius with Spring Cloud
Java Program to Check Cycle in a Graph using Topological Sort
Java 9 Stream API Improvements