Update Binary Tree Insertion

[ymohit1603]

Hey, there is a problem in the code of Binary tree insertion . I think there is a missing return statement in the if(root==NULL) part.
Correct would be
node * insert(node * root, int value)
{
node * newNode = new node();
newNode->data = value;
newNode->left = NULL;
newNode->right = NULL;
if(root == NULL){
root = newNode;
return root; //correction part

}
else if(root->data < value ){
    root->right = insert(root->right , value);
} 
else root->left = insert(root->left , value);
return root;

}