void dfs(struct TreeLinkNode *parent){
if(parent->left == NULL || parent->right == NULL)
return;
parent->left->next = parent->right;
if(parent->next != NULL)
parent->right->next = parent->next->left;
else
parent->right->next = NULL;
dfs(parent->left);
dfs(parent->right);
}
void connect(struct TreeLinkNode *root) {
if(root == NULL)
return;
root->next = NULL;//1th
dfs(root);
}
116 populating next right pointers in each node
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- Given a binary tree Populate each next pointer to point t...
- Given a binary tree Populate each next pointer to point t...
- Populate each next pointer to point to its next right nod...