Pre-order traversal:
Pre-order traversal of Binary search tree is follow the pattern "ROOT LEFT RIGHT"
-That means, we can firstly print root then evalute left portion and then right portion.
Following is the function that are used to traverse the Binary search Tree in Pre-order:
void pre_traverse(struct node *root)
{
if(root!=NULL)
{
printf("%d ",root->data);
pre_traverse(root->leftchild);
pre_traverse(root->rightchild);
}
}