Archive

Posts Tagged ‘data structures’

Maven project for Generic (n-ary) Tree in Java

March 2nd, 2010 vivin No comments

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!

Categories: Java, Programming and Development Tags: , , , , , , ,

Generic (n-ary) Tree in Java

January 30th, 2010 vivin 8 comments

Last week I was solving a problem at work that required the use of a Generic (n-ary) Tree. An n-ary tree is a tree where node can have between 0 and n children. There is a special case of n-ary trees where each node can have at most n nodes (k-ary tree). This implementation focuses on the most general case, where any node can have between 0 and n children. Java doesn’t have a Tree or Tree Node data structure. I couldn’t find any third-party implementations either (like in commons-lang). So I decided to write my own.
Read more…

Categories: Java, Programming and Development Tags: , , , , , , ,