Java code to construct trees with weighted edges pertaining any number of children

0.00/5 (No votes)

See more:

hey friends,
could anyone please suggest me how to code in constructing a tree with weighted edges in binary form and the nodes can have any no of children not binary in particular.and the node value particularly indicating the index so there is mere use of the node value but what is important is the weights of the edges as...
if a node has two children then their weights must be "0","1"...
if a node has three children then their weights must be "00","01","10"... and so on.

Posted 1-Mar-12 1:06am

mushas

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Last 24hrs

This month

Pete O'Hanlon	195
OriginalGriff	85
merano99	50
KarstenK	50
Member 14680718	40

Pete O'Hanlon	205
OriginalGriff	155
Richard MacCutchan	50
merano99	50
KarstenK	50