Click here to Skip to main content
Rate this: bad
good
Please Sign up or sign in to vote.
See more: Trees
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 2:06am
mushas301

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

  Print Answers RSS
0 OriginalGriff 505
1 Maciej Los 309
2 BillWoodruff 174
3 /\jmot 160
4 Suraj Sahoo | Coding Passion 160
0 OriginalGriff 8,484
1 Sergey Alexandrovich Kryukov 7,407
2 DamithSL 5,639
3 Maciej Los 5,159
4 Manas Bhardwaj 4,986


Advertise | Privacy | Mobile
Web01 | 2.8.1411023.1 | Last Updated 1 Mar 2012
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100