?
Solved

Tree Traversal

Posted on 2012-12-23
5
Medium Priority
?
472 Views
Last Modified: 2012-12-26
Can anyone point me to sample code snippets for traversing n-ary tree with k-nodes randomly may be based on some conditions like a Node holding a boolean variable with value as true etc?
0
Comment
Question by:jagadeesh_motamarri
  • 3
  • 2
5 Comments
 
LVL 27

Expert Comment

by:mrcoffee365
ID: 38717737
Sounds like homework.  Why don't you write something and we'll help you with it if you have problems?
0
 
LVL 10

Author Comment

by:jagadeesh_motamarri
ID: 38717886
LOL!!
 I know the obvious rules and kind of missed it [may be because I have in-active for quite sometime in the forum]! I have been part of this community for almost 6 years. Don't think I am in a place to ask home work questions here :-)

If not sample code, you can at least give me pointers on how nodes be accesses randomly!

Anyways, I'll try to post something for tomorrow and see how it goes.

Thanks!
0
 
LVL 27

Expert Comment

by:mrcoffee365
ID: 38717920
You would have to decide what randomly means to you. You could use the random number generator and convert the results to an identifier of a node in your tree.  The whole topic of true randomness is a difficult one.

Or maybe you just mean that you will get requests for nodes and the node might be anywhere in the tree?

You've been asking a series of questions about n-ary trees.  Are you able to describe your problem more clearly?  The reason your questions sound like homework is that the problem descriptions sound like the sort of not real problems you would get in a class.
0
 
LVL 10

Author Comment

by:jagadeesh_motamarri
ID: 38718628
Or maybe you just mean that you will get requests for nodes and the node might be anywhere in the tree?
This is correct.

You've been asking a series of questions about n-ary trees.  Are you able to describe your problem more clearly?
Please look at my other question here

I have more detailed explanation of What I was trying to achieve.
0
 
LVL 27

Accepted Solution

by:
mrcoffee365 earned 2000 total points
ID: 38718854
Yes, that's what I looked at when I was trying to determine whether this was homework or not.  Very generic description.

If you don't post any code, it's harder to get a response from EE.  We don't write code for people.  Given the vagueness of your question, have you tried googling?  I found many, many responses, both of the general problem and with some code samples.  So, for example:
http://vivin.net/2010/01/30/generic-n-ary-tree-in-java/
http://www.cs.auckland.ac.nz/~jmor159/PLDS210/n_ary_trees.html

That might be best if you don't want to write any code at this time.
0

Featured Post

Free Tool: Site Down Detector

Helpful to verify reports of your own downtime, or to double check a downed website you are trying to access.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Java contains several comparison operators (e.g., <, <=, >, >=, ==, !=) that allow you to compare primitive values. However, these operators cannot be used to compare the contents of objects. Interface Comparable is used to allow objects of a cl…
Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
The viewer will learn how to implement Singleton Design Pattern in Java.
Viewers will learn how to properly install Eclipse with the necessary JDK, and will take a look at an introductory Java program. Download Eclipse installation zip file: Extract files from zip file: Download and install JDK 8: Open Eclipse and …

589 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question