Write C code to search for a value in a binary search tree (BST).
October 28, 2007 · Filed Under Placement Questions, Tree
 Don't want to miss a single bit? Subscribe By Email for Daily Jobs |
Here are a few C programs….
mynode *search(int value, mynode *root)
{
while(root!=NULL && value!=root->value)
{
root = (value < root->value)?root->left:root->right;
}
return(root);
}
Here is another way to do the same
mynode *recursive_search(int item, mynode *root)
{
if(root==NULL || item == root->value){return(root);}
if(iteminfo)return{recursive_search(item, root->left);}
return{recursive_search(item, root->right);}
}
Related Articles
- Write C code for iterative preorder, inorder and postorder tree traversals
- Write C code to return a pointer to the nth node of an inorder traversal of a BST.
- Write a C program to create a copy of a tree
- Write a C program to create a mirror copy of a tree (left nodes become right and right nodes become left)!
- How do you reverse a singly linked list? How do you reverse a doubly linked list? Write a C program to do the same.
-
Subscribe
-
Job In Companies
-
Latest Jobs- TCS Freshers Walkin Banking Jobs - TCS BPO
- Sutherland Freshers Walkin
- Syntel Freshers Walkin
- Citigroup Freshers Walkin Jan 6 - 7
- NVIDIA Corp Recruits Freshers Senior Hardware Engineer
- BA Continuum Sol Recruits Freshers Tech Associate
- Convergys Recruits Freshers Technician - Network Services
- Bose Recruits Freshers TECHNICIAN
- RR Donnelley Recruits Freshers Customer Service Executive
- Zensar Tech Recruits Freshers Customer Service Executives