What are the key differences ?
Looking to design a program to store and print out a tree..
Just wondering which data structure to use.
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
TreeNode vs. Node
What are the key differences ?
Looking to design a program to store and print out a tree..
Just wondering which data structure to use.
Related threads:
Re: TreeNode vs. Node
Hi Dear,
There is no difference between tree node and node. if you are going for a double ended link list then you will need a node which is same as like a tree node.
The main thing which makes difference between tree and link list is the logic by which the nodes are linked with each other.
data structure to be used is depends upon the the data to be stored. if you have to store data about students(Linear data) of any class then you can use link list but if you want to store data hierarchical form you should use trees.
But remember one thing if you will store sequential data in the tree form this will reduce time to search a data.
Programmer
Reply With Quote