@Douglas: Here is my approach: Suppose index is the index given and we have to find its depth .Also the tree is N ary
int i=1;
while(index > 0)
{
index=index-N^i;
i++;
}
return index;
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
