where can I find the example of Tree structure using JAVA ?
 

where can I find the example of Tree structure using JAVA ? I would like to do a family tree by using Java. but I have no idea.

Thank you
Kee

a tree in java is also known as a linked list. There are different traversals of a tree but thats more deeper than your looking I think. Google for linked list and you should get what your looking for.


Jason

Actually no a tree in java is not also known as a linked list. A linked list is an entirely different data structure. A linked list is a sequence of interconnected nodes. A linked list is a linear structure, a tree is non-linear.

actually a node in a linked list depending on how you write the code can have two children using 2 different pointers while another pointer points to the parent giving the illusion of a tree. Thats how I wrote all my trees in java


Jason

After suffering through a semester of a data structures course in java in college I have to disagree with you there.

A tree is not a linked list or vice versa.

only 1, I had to do more than just 1 sem on data structures back in college and here is a better description of trees and linked lists...

http://www.cs.utexas.edu/users/oursland/tree/

you may have used a btree class or something but I had to write the whole thing.



Jason

A tree is not a linked list. A tree (be it binary, or n-ary..) can be implemented using linked nodes, similar to a linked-list; or using an array and indices to reference the children and parent (i/2=parent, 2i=left_child, 2i+1=right_child, I think..), and there are other ways still.

The term Tree refers to the idea of a tree structure, independent of implementation. The term Linked-List (they can be singly or doubly-linked) refers specifically to the notion of nodes being linked to one another to give a linear list of nodes.

If a binary tree is implemented as linked nodes, then it is somewhat similar to the implementation of a doubly-linked list. A linked-list in this case is almost identical to a binary tree where each node only has left children. However, once that tree acquires a right child, it is no longer a linked list (as long as the right child is not the node's parent! But then, it wouldn't be a tree any longer, but a graph with cycles..).

Sorry to elaborate, but that was a nice refresher in my mind as well!

Sadiq.

Thank your for elaborating my point. I didn't feel like arguing. I had to go through all of that during my data structures and discrete structures courses in college and didn't feel like going back and digging up the details. We went into great depth on the subject but that was years ago and I was pretty sure my memory of it was correct. :thumbsup: