Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.java.programmer > #10290

Re: Collection to implement linked structure traverse up and down

Show all headers | View raw

On 11-11-28 03:53 AM, ruds wrote:
> Hi,
> I want to implement a tree or a linked structure where I can traverse
> to the parent of a node also and the same node refers to another data
> related to it too.
> for example i have a set [0,1,2,3,...10], consider these as levels,
> so ) will be at top i.e the root, 1 will be first level, and so on.
> each of these levels will again have some branches and some data needs
> to be referenced with this too for comparison with another similar
> tree of this kind. Also, once I get the comparion of the branch X done
> I need to traverse to its parent level and it higher level.
> I think TreeMapClass and LinkedHashMapClass will be helpfull to me in
> this regard.
> This need not be a tree, it can be a linked list too.
> Please tell me am i on the right path? Kindly, suggest the
> implementation too.

If I understand you correctly, one of your requirements is that each
node of the data structure has associated user data, which is distinct
from references to other nodes. This is common.

The distinguishing feature of a node for a singly linked list is that it
has a reference to a "next" sibling. Nodes for doubly linked lists have
two references, one to a "previous" sibling, one to a "next" sibling.
Nodes for a binary tree have zero, one or two references, where any
reference is to a "child". Any or all of these nodes can be implemented
with objects that have not only the required references but also
variable, user-defined data.

It's also helpful to distinguish between concept and implementation. At
this stage we're talking concepts, and the language is clearly that of
trees. In particular where you are talking about tree comparisons this
is all very standard stuff...although your determination of how two
trees compare will typically not start at the bottom.

I don't think TreeMap or LinkedHashMap will help you much. These are
both maps. You can distort them into trees but that's not their intended
purpose. If you're looking to locate a starting implementation you could
do worse than use javax.swing.tree.TreeModel (implementation class
javax.swing.tree.DefaultTreeModel) and javax.swing.tree.TreeNode
(MutableTreeNode, DefaultMutableTreeNode). These are general purpose and
don't have to be used with Swing at all.

AHS

Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Collection to implement linked structure traverse up and down ruds <rudranee@gmail.com> - 2011-11-27 23:53 -0800
  Re: Collection to implement linked structure traverse up and down Arved Sandstrom <asandstrom3minus1@eastlink.ca> - 2011-11-28 07:32 -0400
    Re: Collection to implement linked structure traverse up and down Wayne <nospam@all.invalid> - 2011-12-01 10:39 -0500
      Re: Collection to implement linked structure traverse up and down ruds <rudranee@gmail.com> - 2011-12-04 23:57 -0800
        Re: Collection to implement linked structure traverse up and down Lew <lewbloch@gmail.com> - 2011-12-05 15:08 -0800
          Re: Collection to implement linked structure traverse up and down ruds <rudranee@gmail.com> - 2011-12-05 21:55 -0800
  Re: Collection to implement linked structure traverse up and down Roedy Green <see_website@mindprod.com.invalid> - 2011-11-29 17:01 -0800
    Re: Collection to implement linked structure traverse up and down Henk van Voorthuijsen <voorth@xs4all.nl> - 2011-12-05 02:41 -0800
  Re: Collection to implement linked structure traverse up and down Martin Gregorie <martin@address-in-sig.invalid> - 2011-11-30 21:17 +0000

csiph-web