文件名称:Representing-and-Operating-on-an-N-inary-Tree-V3.
介绍说明－－下载内容均来自于网络，请自行研究使用
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
}-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
}
struct t {
int n
struct t *kids
struct t *siblings
}-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
}
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Representing and Operating on an N-inary Tree V3.doc