Breaking News: Grepper is joining You.com. Read the official announcement!

iterative dfs in tree

Saitama answered on September 27, 2020 Popularity 10/10 Helpfulness 2/10

answer iterative dfs in tree

iterative dfs in tree

Comment

import java.util.Stack; 

class Node 
{ 
    int data; 
    Node left, right; 
  
    public Node(int item) 
    { 
        data = item; 
        left = right = null; 
    } 
} 

@SuppressWarnings("unchecked")
class BinaryTree
{
    Node root;
    public static void inOrderTraversal(Node root)
    {
      Stack<Node> stack = new Stack();
      Node curr = root;
      while (!stack.empty() || curr != null)
      {
        if (curr != null)
        {
          stack.push(curr);
          curr = curr.left;
        }
        else
        {
          curr = stack.pop();
          System.out.print(curr.data + " ");
          curr = curr.right;
        }
      }
    }

}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java tree

Link to this answer
Share Copy Link

Contributed on Sep 27 2020

Saitama

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

iterative dfs in tree

Contents

More Related Answers

iterative dfs in tree

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.