Original Post
When I try to insert a node into the tree I recieve an unhandled exception error and I can''t find out why?
Any Help please
void insertBST(node *&root, node *temp)
{
if(root == NULL)
root = temp;
else
{
node *parent(root);
while((temp->data<=parent->data && parent->left!= NULL) || (temp->data >= parent->data && parent->right != NULL))
{
if(temp->data <= parent->data)
parent = parent->left;
else
parent = parent->right;
}
if(temp->data <= parent->data)
parent->left=temp;
else
parent->right = temp;
}
}
A binary tree just says that each node has at max two children, while a binary search tree is a binary tree where the left node is less than the root node, and the root node is less than the right node (whatever "less" may be).