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

Inorder traversal Algorithm for binary tree

Add Answer

Taiwo Adedotun answered on March 24, 2021 Popularity 10/10 Helpfulness 2/10

answer Inorder traversal Algorithm for binary tree

related preorder traversal

related tree inorder traversal in c

related inorder traversal of tree

related How to perform in-order traversal of a binary tree?

related preorder traversal of binary tree c++

related inorder traversal search

related preorder traversal c++

Inorder traversal Algorithm for binary tree

Comment

Until all nodes are traversed −
Step 1 − Recursively traverse left subtree.
Step 2 − Visit root node.
Step 3 − Recursively traverse right subtree.

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: www.tutorialspoint.com

Tags: algorithm binary-tree inorder traversal whatever

Link to this answer
Share Copy Link

Contributed on Sep 22 2022

Taiwo Adedotun

0 Answers Avg Quality 2/10

Closely Related Answers

preorder traversal

Comments(1)

<> Preorder		Root -> Left -> Right 
<> Inorder		Left -> Root -> Right
<> Postorder	Left -> Right -> Root

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: depth-first-search depth-first-searc

Link to this answer
Share Copy Link

Contributed on Jan 09 2023

correctYourPosture

0 Answers Avg Quality 2/10

tree inorder traversal in c

Comment

// C program for different tree traversals
#include <stdio.h>
#include <stdlib.h>
 
// 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;
};
 
// Helper function that allocates a new node with the
// given data and NULL left and right pointers.
struct node* newNode(int data)
{
    struct node* node
        = (struct node*)malloc(sizeof(struct node));
    node->data = data;
    node->left = NULL;
    node->right = NULL;
 
    return (node);
}
 
// Given a binary tree, print its nodes in inorder
void printInorder(struct node* node)
{
    if (node == NULL)
        return;
 
    // First recur on left child
    printInorder(node->left);
 
    // Then print the data of node
    printf("%d ", node->data);
 
    // Now recur on right child
    printInorder(node->right);
}
 
// Driver code
int main()
{
    struct node* root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);
    root->left->right = newNode(5);
 
    // Function call
    printf("Inorder traversal of binary tree is \n");
    printInorder(root);
 
    getchar();
    return 0;
}

Popularity 9/10 Helpfulness 3/10 Language whatever

Source: www.geeksforgeeks.org

Tags: c inorder inorde

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Naufil Asar

0 Answers Avg Quality 2/10

inorder traversal of tree

Comment

//*******this is a C program for implementation and searching in A BT*******
#include<stdlib.h>
#include <stdio.h>

struct BinaryTree{
    int data;
    struct BinaryTree*right;
    struct BinaryTree*left;
};

struct BinaryTree*createnode(int val){
    struct BinaryTree*root=(struct BinaryTree*)malloc(sizeof(struct BinaryTree));
    root->data=val;
    root->left=NULL;
    root->right=NULL;
    
}

void inorder(struct BinaryTree*root){
    if(root==NULL){
    return;
    }
    else {inorder(root->left);
    printf("%d->",root->data);
    inorder(root->right);
}

}
 
void preorder(struct BinaryTree*root){
    if(root==NULL){
        return;
    }
    else {
        printf("%d->",root->data);
        preorder(root->left);
        preorder(root->right);
    }
}

void postorder(struct BinaryTree*root){
    if(root==NULL){
        return;
    }
    else{
        postorder(root->left);
        postorder(root->right);
        printf("%d->",root->data);
    }
}
int main()
{
    printf("Lets grow the tree\n");
    struct BinaryTree*root=createnode(1);
    root->left=createnode(2);
    root->right=createnode(3);
    root->left->left=createnode(4);
    root->left->right=createnode(5);
    
    printf("tree has grown up\n");
    
    printf("Inorder traversal ");
    inorder(root);printf("NULL");

    printf("\npreorder traversal ");
    preorder(root);printf("NULL");
    
    printf("\nPostorder  traversal");
    postorder(root);printf("NULL");
    
    return 0 ;
}

Popularity 10/10 Helpfulness 2/10 Language c

Source: Grepper

Tags: c

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

Unusual Unicorn

0 Answers Avg Quality 2/10

How to perform in-order traversal of a binary tree?

Comment

/*
	This is an implementation that collects the 
	values of the nodes of a binary tree by performing 
	an in-order traversal of the tree.

	Let n be the number of binary tree nodes
	Time complexity: O(n) 
	Space complexity: O(n)
*/
import java.util.List;
import java.util.ArrayList;

public class BTInOrderTraversal {
	private BTNode BTRoot;
	public BTInOrderTraversal() {
		/*
		 * Create tree below:
		 * 1
		 * \
		 * 2
		 * /
		 * 3
		 */
		BTRoot = new BTNode(1, null, null);
		BTNode rootRight = new BTNode(2, null, null);
		BTRoot.right = rootRight;
		BTNode rootRightLeft = new BTNode(3, null, null);
		rootRight.left = rootRightLeft;
	}
	public static void main(String[] args) {
		BTInOrderTraversal application = new BTInOrderTraversal();
		List<Integer> values = application.inorderTraversal();
		System.out.println(values); // [1, 3, 2]
	}
	// Perform in-order traversal through the tree.
	public List<Integer> inorderTraversal() {
		List<Integer> list = new ArrayList<>();
		populateList(BTRoot, list);
		return list;
	}
	// Helper method to populate list by performing
	// in-order traversal through the tree.
	private void populateList(BTNode root, List<Integer> list) {
		if (root == null) {
			return;
		}
		if (root.left != null) {
			populateList(root.left, list);
		}
		list.add(root.val);
		if (root.right != null) {
			populateList(root.right, list);
		}
	}
	// Class representing a binary tree node
	// with pointers to value, left, and right nodes
	private class BTNode {
		int val;
		BTNode left;
		BTNode right;
		public BTNode(int val, BTNode left, BTNode right) {
			this.val = val;
			this.left = left;
			this.right = right;
		}
	}
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on May 27 2022

Wissam

0 Answers Avg Quality 2/10

preorder traversal of binary tree c++

Comment

#include <bits/stdc++.h>

using namespace std;

struct node {
  int data;
  struct node * left, * right;
};

vector < int > preOrderTrav(node * curr) {
  vector < int > preOrder;
  if (curr == NULL)
    return preOrder;

  stack < node * > s;
  s.push(curr);

  while (!s.empty()) {
    node * topNode = s.top();
    preOrder.push_back(topNode -> data);
    s.pop();
    if (topNode -> right != NULL)
      s.push(topNode -> right);
    if (topNode -> left != NULL)
      s.push(topNode -> left);
  }
  return preOrder;

}

struct node * newNode(int data) {
  struct node * node = (struct node * ) malloc(sizeof(struct node));
  node -> data = data;
  node -> left = NULL;
  node -> right = NULL;

  return (node);
}

int main() {

  struct node * root = newNode(1);
  root -> left = newNode(2);
  root -> right = newNode(3);
  root -> left -> left = newNode(4);
  root -> left -> right = newNode(5);
  root -> left -> right -> left = newNode(8);
  root -> right -> left = newNode(6);
  root -> right -> right = newNode(7);
  root -> right -> right -> left = newNode(9);
  root -> right -> right -> right = newNode(10);

  vector < int > preOrder;
  preOrder = preOrderTrav(root);

  cout << "The preOrder Traversal is : ";
  for (int i = 0; i < preOrder.size(); i++) {
    cout << preOrder[i] << " ";
  }
  return 0;
}

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: takeuforward.org

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Dec 10 2023

Hitesh Prajapati

0 Answers Avg Quality 2/10

inorder traversal search

Comment

class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

def printInorder(root):
    if root:
        printInorder(root.left)
        print(root.val),
        printInorder(root.right)

if __name__ == "__main__":
    root = Node(1)
    root.left = Node(2)
    root.right = Node(3)
    root.left.left = Node(4)
	root.left.right = Node(5)

print("\n Inorder traversal of binary tree is")
printInorder(root)
print(root)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Oct 07 2022

Adam, the developer

0 Answers Avg Quality 2/10

preorder traversal c++

Comment

a
s
d

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ preorder traversal

Link to this answer
Share Copy Link

Contributed on Mar 24 2021

Jolly Jackal

0 Answers Avg Quality 2/10

postorder traversal using stack

Comment

1. Right child of 1 exists. 
   Push 3 to stack. Push 1 to stack. Move to left child.
        Stack: 3, 1
2. Right child of 2 exists. 
   Push 5 to stack. Push 2 to stack. Move to left child.
        Stack: 3, 1, 5, 2
3. Right child of 4 doesn't exist. '
   Push 4 to stack. Move to left child.
        Stack: 3, 1, 5, 2, 4
4. Current node is NULL. 
   Pop 4 from stack. Right child of 4 doesn't exist. 
   Print 4. Set current node to NULL.
        Stack: 3, 1, 5, 2
5. Current node is NULL. 
    Pop 2 from stack. Since right child of 2 equals stack top element, 
    pop 5 from stack. Now push 2 to stack.     
    Move current node to right child of 2 i.e. 5
        Stack: 3, 1, 2
6. Right child of 5 doesn't exist. Push 5 to stack. Move to left child.
        Stack: 3, 1, 2, 5
7. Current node is NULL. Pop 5 from stack. Right child of 5 doesn't exist. 
   Print 5. Set current node to NULL.
        Stack: 3, 1, 2
8. Current node is NULL. Pop 2 from stack. 
   Right child of 2 is not equal to stack top element. 
   Print 2. Set current node to NULL.
        Stack: 3, 1
9. Current node is NULL. Pop 1 from stack. 
   Since right child of 1 equals stack top element, pop 3 from stack. 
   Now push 1 to stack. Move current node to right child of 1 i.e. 3
        Stack: 1
10. Repeat the same as above steps and Print 6, 7 and 3. 
    Pop 1 and Print 1.

Popularity 7/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: postorder stack

Link to this answer
Share Copy Link

Contributed on Sep 06 2024

Amjad Saeed

0 Answers Avg Quality 2/10

Inorder Traversal using Stack:

Comment

Inorder Traversal using Stack:
As we already know, recursion can also be implemented using stack. Here also we can use a stack to perform inorder traversal of a Binary Tree. Below is the algorithm for traversing a binary tree using stack.

Create an empty stack (say S).
Initialize the current node as root.
Push the current node to S and set current = current->left until current is NULL
If current is NULL and the stack is not empty then:
Pop the top item from the stack.
Print the popped item and set current = popped_item->right 
Go to step 3.

Popularity 7/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: inorder traversal traver

Link to this answer
Share Copy Link

Contributed on Sep 06 2024

Amjad Saeed

0 Answers Avg Quality 2/10

Inorder traversal Algorithm for binary tree

Contents

More Related Answers

Inorder traversal Algorithm for binary tree

Closely Related Answers

preorder traversal

tree inorder traversal in c

inorder traversal of tree

How to perform in-order traversal of a binary tree?

preorder traversal of binary tree c++

inorder traversal search

preorder traversal c++

postorder traversal using stack

Inorder Traversal using Stack:

Grepper

Documentation

Social

Legal

Contact

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