You are viewing a single comment's thread. Return to all comments →
struct node* insert( struct node* root, int data ) { struct node* e =(struct node*) malloc(sizeof(struct node)); e->data = data; e->left =e->right = NULL; struct node *head = root,*prev; if (root == NULL) return e; while (head != NULL) { prev = head; if (data < head->data) head = head->left; else head = head->right; } if(datadata) prev->left = e; else prev->right = e;
return root;
}
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Search Tree : Insertion
You are viewing a single comment's thread. Return to all comments →
struct node* insert( struct node* root, int data ) { struct node* e =(struct node*) malloc(sizeof(struct node)); e->data = data; e->left =e->right = NULL; struct node *head = root,*prev; if (root == NULL) return e; while (head != NULL) { prev = head; if (data < head->data) head = head->left; else head = head->right; } if(datadata) prev->left = e; else prev->right = e;
return root;
}