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

preorder without recursion

Homeless Hornet answered on May 1, 2020 Popularity 9/10 Helpfulness 2/10

answer preorder without recursion

related inorder without recursion

preorder without recursion

Comment

void iterativePreorder(node *root) 
{ 
    // Base Case 
    if (root == NULL) 
       return; 
  
    // Create an empty stack and push root to it 
    stack<node *> nodeStack; 
    nodeStack.push(root); 
    while (nodeStack.empty() == false) 
    { 
        // Pop the top item from stack and print it 
        struct node *node = nodeStack.top(); 
        printf ("%d ", node->data); 
        nodeStack.pop(); 
  
        // Push right and left children of the popped node to stack 
        if (node->right) 
            nodeStack.push(node->right); 
        if (node->left) 
            nodeStack.push(node->left); 
    } 
}

Popularity 9/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: preorder recursion whatever

Link to this answer
Share Copy Link

Contributed on May 01 2020

Homeless Hornet

0 Answers Avg Quality 2/10

Closely Related Answers

inorder without recursion

Comment

// C++ program to print inorder traversal
// using stack.
#include<bits/stdc++.h>
using namespace std;
 
/* A binary tree Node has data, pointer to left child
   and a pointer to right child */
struct Node
{
    int data;
    struct Node* left;
    struct Node* right;
    Node (int data)
    {
        this->data = data;
        left = right = NULL;
    }
};
 
/* Iterative function for inorder tree
   traversal */
void inOrder(struct Node *root)
{
    stack<Node *> s;
    Node *curr = root;
 
    while (curr != NULL || s.empty() == false)
    {
        /* Reach the left most Node of the
           curr Node */
        while (curr !=  NULL)
        {
            /* place pointer to a tree node on
               the stack before traversing
              the node's left subtree */
            s.push(curr);
            curr = curr->left;
        }
 
        /* Current must be NULL at this point */
        curr = s.top();
        s.pop();
 
        cout << curr->data << " ";
 
        /* we have visited the node and its
           left subtree.  Now, it's right
           subtree's turn */
        curr = curr->right;
 
    } /* end of while */
}
 
/* Driver program to test above functions*/
int main()
{
 
    /* Constructed binary tree is
              1
            /   \
          2      3
        /  \
      4     5
    */
    struct Node *root = new Node(1);
    root->left        = new Node(2);
    root->right       = new Node(3);
    root->left->left  = new Node(4);
    root->left->right = new Node(5);
 
    inOrder(root);
    return 0;
}

Popularity 4/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ inorder recursion

Link to this answer
Share Copy Link

Contributed on Nov 29 2022

it's_flat

0 Answers Avg Quality 2/10

preorder without recursion

Contents

More Related Answers

preorder without recursion

Closely Related Answers

inorder without recursion

Grepper

Documentation

Social

Legal

Contact

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