
308 Data Structures Using C
if (result == 1)
printf (“\n Search Successful”);
else
printf (“\n Search Un-Successful”);
}
struct binNode *createBinTree()
{
} /* this function createBinTree() is same as developed in above examples */
int searchBST (struct binNode *binTree, int val)
{ int flag;
if (binTree == NULL)
return 0;
if (val == binTree->val)
return 1;
else
if (val < binTree-> val)
flag=searchBST(binTree->leftChild, val);
else
flag=searchBST(binTree->rightChild, val);
return flag;
}
The above program has been tested.
7.5.2.3 Insertion into a Binary Search Tree The insertion in a BST is basically a search operation.
The item to be inserted is searched within ...