Building a tree structure

[subrato jagan]

I have to build a tree structure with the following data
lets say that with this data
childId parentId

1 - 1 (lets say this is root)
2 - 1
3 - 1
4 - 3
5 - 3
6 - 5
7 - 6

all I need is that i need to have a way of finding out the
individual child's level
by level i mean

1 - level 0
2 - level 1 (only 1 parent)
3 - level 1
4 - level 2 (one parent and 1 grand parent)
5 - level 2
6 - level 3
7 - level 4

any ideas would be welcome

[R van Vliet]

Perhaps I'm oversimplifying here but once you have the tree structure wouldnt a simple recursive counting method do the trick? :

public int getLevel() {
 
   if(getParent() != null)
      return getParent().getLevel() + 1;
   else
      return 1; // Or 0 if your root is level 0
}

[Stan James]

You can avoid recursion if that matters to you ... to get the level for "subject" ...

Node n = subject
while n.parent != null
   count += 1
   n = n.parent
end while
print count

I used to see this kind of thing in GUIs where an event handler wants to work back up to the parent window or some other container.

[Campbell Ritchie]

Saurabh Pol,
Your post was moved to a new topic.