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

binary search tree insertion c

Add Answer

Healthy Hare answered on September 23, 2022 Popularity 8/10 Helpfulness 1/10

answer binary search tree insertion c

related Insertion in a binary search tree

binary search tree insertion c

Comment

-1

#include "stdio.h"
#include "stdlib.h"
struct node{
    int data;
    struct node *r,*l;
};
//struct node *temp=NULL;
struct node *newnode(int x)
{
    struct node *root=(struct node*)malloc(sizeof(struct node));
    root->data=x;
    root->l=NULL;
    root->r=NULL;
    return root;
}
struct node *create(struct node *root,int x)
{
    if(root==NULL)
        return newnode(x);
    if(x < root->data)
        root->l=create(root->l,x);
    else if(x > root->data)
        root->r=create(root->r,x);
    
    return root;
}
void inorder(struct node *root)
{
    if(root==NULL)
        return;
    else
    {
        inorder(root->l);
        printf("%d ",root->data);
        inorder(root->r);
    }
        //printf("\n");

}
struct node *MinValNode()
{
    
}
int main()
{
    struct node *temp=NULL;
    int n,x,w;
    ////scanf("%d",&x);
    while(w!=-1)
    {
        scanf("%d",&w);
        printf("X:");
        scanf("%d",&x);
        temp=create(temp,x);
        printf("Inserted\n");
        
        if(w==2)
            inorder(temp);

    }

}

Popularity 8/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: binary-search-tree c insertion whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Healthy Hare

0 Answers Avg Quality 2/10

Closely Related Answers

Insertion in a binary search tree

Comment

from binarytree import Node

def insert(T, val):
    parent = search(T, val)
    if val == parent.val: #the value exists in the tree
       return #do nothing
    newnode = Node(val)
    if val < parent.value: #the value is less than the parent
        parent.left = newnode 
    else:  #the value is greater than the parent
        parent.right = newnode

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: www.pynerds.com

Tags: binary-search-tree whatever insertion

Link to this answer
Share Copy Link

Contributed on Mar 08 2024

John Main

0 Answers Avg Quality 2/10

binary search tree insertion c

Contents

More Related Answers

binary search tree insertion c

Closely Related Answers

Insertion in a binary search tree

Grepper

Documentation

Social

Legal

Contact

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