Click here to Skip to main content
11,812,712 members (67,933 online)
Rate this: bad
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 1:06am

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

  Print Answers RSS
0 Abhinav S 270
1 CHill60 180
2 KrunalRohit 154
3 Palash Mondal_ 145
4 Sergey Alexandrovich Kryukov 140
0 OriginalGriff 3,877
1 KrunalRohit 2,496
2 CPallini 2,240
3 Maciej Los 2,205
4 ppolymorphe 1,750

Advertise | Privacy | Mobile
Web04 | 2.8.151002.1 | Last Updated 1 Mar 2012
Copyright © CodeProject, 1999-2015
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