Write a C program to find the mininum value in a binary search tree.
October 28, 2007 · Filed Under Placement Questions, Tree
 Don't want to miss a single bit? Subscribe By Email for Daily Jobs |
Here is some sample C code. The idea is to keep on moving till you hit the left most node in the tree
int minValue(struct node* node)
{
struct node* current = node;
while (current->left != NULL)
{
current = current->left;
}
return(current->data);
}
On similar lines, to find the maximum value, keep on moving till you hit the right most node of the tree.
Related Articles
- Write a C program to find the mininum value in a binary search tree.
- Write C code to check if a given binary tree is a binary search tree or not?
- Write a C program to remove duplicates from a sorted linked list
- Write a C program to insert nodes into a linked list in a sorted fashion
- Write C code to return a pointer to the nth node of an inorder traversal of a BST.
-
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