AI coding assistant for busy programmers

All

JavaScript

How do you print all nodes of a given binary tree using inorder traversal without recursion in Java

Java

public class InorderTraversal {
	public static void main(String[] args) {
		TreeNode root = new TreeNode(1);
		root.left = new TreeNode(2);
		root.right = new TreeNode(3);
		root.left.left = new TreeNode(4);
		root.left.right = new TreeNode(5);

inorderTraversal(root);

}

public static void inorderTraversal(TreeNode root) {
        if (root == null) return;

Stack<TreeNode> stack = new Stack<>();

while (true) {
            while (root != null) {
                stack.push(root);
                root = root.left;
            }

if (stack.isEmpty()) break;

root = stack.pop();

System.out.println(" " + root.val + " ");

root = root.right;
        }  // end of while loop !!!

}  // end of method !!!

public static class TreeNode {
     int val;
     TreeNode left;
     TreeNode right;

public TreeNode() {}

public TreeNode(int val) { this.val = val;}

public String toString() { return "" + this.val;}   // end of method toString() !!!   */}

🤖 Code Explanation

This code is implementing an inorder traversal of a binary tree. The inorder traversal is a type of tree traversal that visits the left child, then the root, and then the right child. The code uses a stack to keep track of the nodes that have been visited.

AI coding assistant for busy programmers

How do you print all nodes of a given binary tree using inorder traversal without recursion in Java

Java

🤖 Code Explanation

More problems solved in Java