Binary Tree problem

[pentiumPunk]

Lets say i have a binary tree that looks like this:


root -> O

O <--- one of the nodes i
need nodeValue's for ---> O



In my binary tree...i have recusively traced down to a leaf node ( no left
or right pointers). i want the nodeValue of my current node....how do i get
it, if all i have access to is the root node. and root->left->nodeValue
doesnt work because the user defines whether it goes to the left or right
from the root? thanks! ~pentiumPunk~

 

[Karl Heinz Buchegger]

Lets say i have a binary tree that looks like this:

root -> O

O <--- one of the nodes i
need nodeValue's for ---> O

In my binary tree...i have recusively traced down to a leaf node ( no left
or right pointers). i want the nodeValue of my current node....how do i get
it, if all i have access to is the root node. and root->left->nodeValue
doesnt work because the user defines whether it goes to the left or right
from the root? thanks! ~pentiumPunk~

Show the code you already have.
It is much easier to make suggestions, when we see what you have, where
you have problems and at what skill level you are operating.

But usually one has a find() function which returns a pointer
to the node. The caller then can do a lot of things with that
pointer, eg. use it to look up the data value.