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

tree inorder traversal in c

Add Answer

Naufil Asar answered on June 18, 2022 Popularity 9/10 Helpfulness 3/10

answer tree inorder traversal in c

related inorder traversal of tree

related Inorder traversal Algorithm for binary tree

related Tree: Inorder Traversal

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 traversal tree whatever

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Naufil Asar

0 Answers Avg Quality 2/10

Closely Related Answers

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

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 algo

Link to this answer
Share Copy Link

Contributed on Sep 22 2022

Taiwo Adedotun

0 Answers Avg Quality 2/10

Tree: Inorder Traversal

Comment

def inOrder(root):
    if root:
        inOrder(root.left)
        print(root, end = " ")
        inOrder(root.right)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Grieving Gazelle

0 Answers Avg Quality 2/10

tree inorder traversal in c

Contents

More Related Answers

tree inorder traversal in c

Closely Related Answers

inorder traversal of tree

Inorder traversal Algorithm for binary tree

Tree: Inorder Traversal

Grepper

Documentation

Social

Legal

Contact

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