Comments on: Generic (n-ary) Tree in Java

By: Devonte

Devonte — Fri, 24 Feb 2012 17:25:44 +0000

Could you possibly send me a method that iterates over the whole tree?

By: Devonte

Devonte — Thu, 23 Feb 2012 23:28:07 +0000

main question though is that this can be more than just a binary tree? for example a quaternary tree where each node can lead to 4 options

By: Devonte

Devonte — Thu, 23 Feb 2012 22:13:49 +0000

Is this the latest implementation on this website. I believe this is exactly what im looking for in my project. Just to be clear this is a tree that can have any number of root nodes? also the T data that could also be anything? e.g. a simple string or a whole list of properties per say?

By: Manoj Rajan

Manoj Rajan — Mon, 09 Jan 2012 11:54:24 +0000

Thanks, vivin.

It was helpful. Implementation was easy and understandable much faster.

By: vivin

vivin — Sun, 11 Dec 2011 19:42:05 +0000

@John Vorwald: Thanks!

By: vivin

vivin — Sun, 11 Dec 2011 19:40:57 +0000

@Fernando: The purpose of the "build" methods is to return a representation of the tree as a list in either preorder, or postorder form. The "buildWithDepth" returns a representation of the tree with the depths of the node as well, which is useful if you're trying to provide a graphical representation of the tree. In hindsight, I believe it would have been better to implement an iterator!

By: Fernando

Fernando — Sun, 11 Dec 2011 17:14:37 +0000

Hi,

Probably I`m missing the point but what is the real purpose of build* methods? I mean, except for testing, why I would use a List ? BTW, I don’t think that “build” is the correct name. Can you “build a generic tree” ?

My $,02.

Cheers,

–FM

By: John Vorwald

John Vorwald — Sun, 11 Dec 2011 12:48:19 +0000

Here are two additional routines to allow searching for data.

public List locateOccurances(T data) {
List< GenericTreeNode > occurances = new ArrayList();
if (root != null) {
occurances.addAll( locateOccurances(root, data) );
}
return occurances;
}

public List locateOccurances(GenericTreeNode node, T data) {
List< GenericTreeNode > occurances = new ArrayList();

if (node.data == data) {
occurances.add(node);
}
for (GenericTreeNode child:node.children) {
occurances.addAll( locateOccurances(child, data) );
}
return occurances;
}

By: miliardopiscrat

miliardopiscrat — Fri, 23 Sep 2011 23:14:42 +0000

class GenericTreeNode.java line 68, put there keyword @Override and see if it compile.

By: Maven project for Generic (n-ary) Tree in Java | Rough Book

Maven project for Generic (n-ary) Tree in Java | Rough Book — Wed, 25 May 2011 16:14:36 +0000

[...] Guus was kind enough to make a maven project for the Generic Tree. He also fixed an error in my equals method for the GenericTreeNode (I intended to do Object.equals(Object obj) but was doing GenericTreeNode.equals(GenericTreeNode obj). Since it’s a maven project, you can easily create a jar out of it and add it as a dependency to your project. You can download the project here. Thanks Guus! AKPC_IDS += "1405,";Popularity: unranked [?] Related PostsGeneric (n-ary) Tree in JavaCherryBlossomIntroducing CherryBlossomif-else in bAdkOdebAdkOde: An Esoteric LanguageJSTL, instanceof, and hasPropertyDuct-tape programmers are not heroesPerformance testing using The GrinderRunning the JavaFX 1.1 SDK on LinuxRunning the JavaFX 1.0 SDK on Linux Categories: Java, Programming and Development Tags: data structures, generic trees, java, k-ary trees, n-ary trees, programming, software engineering, trees (data structure) Comments (3) Trackbacks (0) Leave a comment Trackback [...]