CareerCup

int distance(Node *n, int key, int dist){

    // if node is null, key couldn't be found
    if(!n) return 0;

    if(n->val == val) return 0;

    distance(n->left, val, dist+1);
    distance(n->right, val, dist+1);
}

is it binary search treE??

HI Sneha, have a look & let me know if for any test cases it will fail
shashank7s dot blogspot dot com/2011/05/wap-to-implement-addsubtractmultiplicat dot html

PS:put . in place of dot & remove spaces"

Shashank

static int DistanceRec(btree *p, int nodeVal, int depth);

int Distance(btree *p, int nodeVal)
{
int depth;
depth = DistanceRec(p, nodeVal, 0);

if(depth >= 0)
return depth;
else
{
printf("error");
return -1;
}
}

static int DistanceRec(btree *p, int nodeVal, int depth)
{
int dep;
if(p == NULL)
return -1;

if(p->key == nodeVal)
return depth;

dep = DistanceRec(p->left, nodeVal, depth+1);
if(dep > 0)
return dep;
return DistanceRec(p->right, nodeVal, depth+1);
}

//call with height=1

int distance(int num,tree *temp,int height)
{
if(temp==NULL) return 0;
if(temp->val==n)
return height;
else return (distance(n,temp->left,height+1) | distance(n,temp->right,height+1));
}

//finally check if height=0 then element doesnt exist...

distance of any node to any other node that is below it. Assume: n2 is below n1.

Dist(n1, n2) = Dist(root, n1) + Dist(root, n2) - 2*Dist(root, lca)

in this, Dist(n1, n2) = Dist(root, n2) - Dist(root, n1)

int finddistance(int n,tree *temp,int height=0)
{
if(temp->val==n)
return height;
else
{
if(temp->left!=NULL)
return findheight(n,temp->left,height+1);
if(temp->right!=NULL)
return findheight(n,temp->right,height+1);

}
}

<pre lang="" line="1" title="CodeMonkey76273" class="run-this">void findDistance(node *root, int find, int distance, int& maxdistance)
{
if(!root) return;
if(root->data==find) { maxdistance=distance; return; }

findDistance(root->left,find,distance+1,maxdistance);
findDistance(root->right,find,distance+1,maxdistance);

}

int main()
{
node *root=createTree();

int maxdistance=-1;

findDistance(root,25,0,maxdistance);

cout<<"The distance is "<<maxdistance;

cin.ignore(2);
return 0;
}</pre><pre title="CodeMonkey76273" input="yes">
</pre>