{"id":27231,"date":"2018-01-05T21:48:48","date_gmt":"2018-01-05T16:18:48","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27231"},"modified":"2018-01-05T21:48:48","modified_gmt":"2018-01-05T16:18:48","slug":"c-program-lowest-common-ancestor-binary-search-tree","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-program-lowest-common-ancestor-binary-search-tree\/","title":{"rendered":"C Program Lowest Common Ancestor in a Binary Search Tree"},"content":{"rendered":"

Given values of two nodes in a Binary Search Tree, write a c program to find the L<\/strong>owest C<\/strong>ommon A<\/strong>ncestor (LCA). You may assume that both the values exist in the tree.<\/span><\/p>\n

The function prototype should be as follows:<\/p>\n

 struct node *lca(node* root, int n1, int n2)\r\n n1 and n2 are two given values in the tree with given root.<\/pre>\n
For example, consider the BST in diagram, LCA of 10 and 14 is 12 and LCA of 8 and 14 is 8.<\/p>\n
Following is definition of LCA from Wikipedia:<\/strong>
\nLet T be a rooted tree. The lowest common ancestor between two nodes n1 and n2 is defined as the lowest node in T that has both n1 and n2 as descendants (where we allow a node to be a descendant of itself).<\/p>\n
The LCA of n1 and n2 in T is the shared ancestor of n1 and n2 that is located farthest from the root. Computation of lowest common ancestors may be useful, for instance, as part of a procedure for determining the distance between pairs of nodes in a tree: the distance from n1 to n2 can be computed as the distance from the root to n1, plus the distance from the root to n2, minus twice the distance from the root to their lowest common ancestor.<\/p>\n
\n
[ad type=”banner”]<\/h4>\n<\/div>\n
If we are given a BST where every node has parent pointer<\/strong>, then LCA can be easily determined by traversing up using parent pointer and printing the first intersecting node.<\/p>\n
We can solve this problem using BST properties. We can recursively traverse<\/strong> the BST from root. The main idea of the solution is, while traversing from top to bottom, the first node n we encounter with value between n1 and n2, i.e., n1 < n < n2 or same as one of the n1 or n2, is LCA of n1 and n2 (assuming that n1 < n2). So just recursively traverse the BST in, if node\u2019s value is greater than both n1 and n2 then our LCA lies in left side of the node, if it\u2019s is smaller than both n1 and n2, then LCA lies on right side. Otherwise root is LCA (assuming that both n1 and n2 are present in BST)<\/p>\n
 
 C Programming<\/span> <\/div> 
\/\/ A recursive C program to find LCA of two nodes n1 and n2.#include <stdio.h>#include <stdlib.h> struct node{    int data;    struct node* left, *right;}; \/* Function to find LCA of n1 and n2. The function assumes that both   n1 and n2 are present in BST *\/struct node *lca(struct node* root, int n1, int n2){    if (root == NULL) return NULL;     \/\/ If both n1 and n2 are smaller than root, then LCA lies in left    if (root->data > n1 && root->data > n2)        return lca(root->left, n1, n2);     \/\/ If both n1 and n2 are greater than root, then LCA lies in right    if (root->data < n1 && root->data < n2)        return lca(root->right, n1, n2);     return root;} \/* Helper function that allocates a new node with the given data.*\/struct node* newNode(int data){    struct node* node = (struct node*)malloc(sizeof(struct node));    node->data  = data;    node->left  = node->right = NULL;    return(node);} \/* Driver program to test lca() *\/int main(){    \/\/ Let us construct the BST shown in the above figure    struct node *root        = newNode(20);    root->left               = newNode(8);    root->right              = newNode(22);    root->left->left         = newNode(4);    root->left->right        = newNode(12);    root->left->right->left  = newNode(10);    root->left->right->right = newNode(14);     int n1 = 10, n2 = 14;    struct node *t = lca(root, n1, n2);    printf("LCA of %d and %d is %d \\n", n1, n2, t->data);     n1 = 14, n2 = 8;    t = lca(root, n1, n2);    printf("LCA of %d and %d is %d \\n", n1, n2, t->data);     n1 = 10, n2 = 22;    t = lca(root, n1, n2);    printf("LCA of %d and %d is %d \\n", n1, n2, t->data);     getchar();    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
LCA of 10 and 14 is 12\r\nLCA of 14 and 8 is 8\r\nLCA of 10 and 22 is 20<\/pre>\n[ad type=”banner”]\n
Time complexity of above solution is O(h) where h is height of tree. Also, the above solution requires O(h) extra space in function call stack for recursive function calls. We can avoid extra space using iterative solution<\/strong>.<\/p>\n
\n
\n
 
 c<\/span> <\/div> 
\/* Function to find LCA of n1 and n2. The function assumes that both   n1 and n2 are present in BST *\/struct node *lca(struct node* root, int n1, int n2){    while (root != NULL)    {         \/\/ If both n1 and n2 are smaller than root, then LCA lies in left        if (root->data > n1 && root->data > n2)           root = root->left;         \/\/ If both n1 and n2 are greater than root, then LCA lies in right        else if (root->data < n1 && root->data < n2)           root = root->right;         else break;    }    return root;}<\/code><\/pre> <\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
C Program Lowest Common Ancestor in a Binary Search Tree – Data Structure – write a c program to find the Lowest Common Ancestor (LCA).<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[80126,69866,1],"tags":[81212,81239,81209,81210,70052,70270,70265,70321,70277,80557,70268,70296,81218,81219,79501,73332,70280,81213,81216],"class_list":["post-27231","post","type-post","status-publish","format-standard","hentry","category-binary-search-tree","category-c-programming","category-coding","tag-ancestor-tree","tag-ancestry","tag-ancestry-find","tag-ancestry-search","tag-binary-search","tag-binary-search-in-c","tag-binary-search-program-in-c","tag-binary-search-program-in-cpp","tag-binary-search-tree-java","tag-binary-search-tree-with-example","tag-binary-tree","tag-binary-tree-example","tag-binary-tree-interview-questions-java","tag-binary-tree-using-array","tag-data-structure-tutorial-pdf","tag-data-structures-in-c-pdf","tag-search-tree","tag-table-trees","tag-tree-interview-questions-java"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27231","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27231"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27231\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27231"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27231"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27231"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}