Title:
Representing-and-Operating-on-an-N-inary-Tree-V3.
Download
- Category:
- Algorithm
- Tags:
-
[WORD]
- File Size:
- 15kb
- Update:
- 2013-05-20
- Downloads:
- 0 Times
- Uploaded by:
- subodh
Description: This representation is a bit annoying because the kids array must be allocated separately from the node, and you need to reallocate the kids array every time you add a new kid to a node. Alternatively, you could instead over-allocate in anticipation of more nodes being added, but then you have to record the array capacity within the node. (The latter representation is exactly what I used for the tree of stack traces in Massif.)
struct t {
int n
struct t *kids
struct t *siblings
}
To Search:
File list (Check if you may need any files):
Representing and Operating on an N-inary Tree V3.doc
