N[1,12]
|__N[2,7]
| |__N[3,4]
| |__N[5,6]
|__N[8,11]
|__N[9,10]
请完成遍历算法给节点赋左右值。
typedef struct node_t { int left; int right; int n_children; (1)____ children; } NODE; int visit(NODE * node, int value) { node->left = value; int i = 0; for(i=0; in_children; i++) { (2)______ } (3)______ return value; } int initLR(NODE* root) { return visit(root, 1); }