Solved

Tree Traversal

Posted on 2012-12-23
5
457 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 26

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 26

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 26

Accepted Solution

by:
mrcoffee365 earned 500 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

What Should I Do With This Threat Intelligence?

Are you wondering if you actually need threat intelligence? The answer is yes. We explain the basics for creating useful threat intelligence.

Join & Write a Comment

An old method to applying the Singleton pattern in your Java code is to check if a static instance, defined in the same class that needs to be instantiated once and only once, is null and then create a new instance; otherwise, the pre-existing insta…
Java Flight Recorder and Java Mission Control together create a complete tool chain to continuously collect low level and detailed runtime information enabling after-the-fact incident analysis. Java Flight Recorder is a profiling and event collectio…
Viewers will learn about the different types of variables in Java and how to declare them. Decide the type of variable desired: Put the keyword corresponding to the type of variable in front of the variable name: Use the equal sign to assign a v…
Viewers will learn about basic arrays, how to declare them, and how to use them. Introduction and definition: Declare an array and cover the syntax of declaring them: Initialize every index in the created array: Example/Features of a basic arr…

747 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

Need Help in Real-Time?

Connect with top rated Experts

18 Experts available now in Live!

Get 1:1 Help Now