Binary Search Tree : Lowest Common Ancestor

  • + 0 comments
    i was basically storing the address of the of each node through which we are passing for v1 and v2 in add1 and add2 respectively
    i want to ask few questions:-
    solution is a structure (in this question) , when we are calling Lca function (MYTREE.LCA(ROOT,V1,V2) , does the "instance of struct solution " will have --> add1[25] , add2[25], int i,j ; when function is called
    on each function call (root=lca(root->left,v1,v2) ) in each "IF" statement does the add1[25] , add2[25], int i,j , will again take memory OR one single copy of add1[25] , add2[25], int i,j ; is only there, as only one insance is made;