本文主要是介绍leetcode 117 Populating Next Right Pointers in Each Node II，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1/ \2 3/ \ \4 5 7
After calling your function, the tree should look like:
1 -> NULL/ \2 -> 3 -> NULL/ \ \4-> 5 -> 7 -> NULL
Subscribe to see which companies asked this question
class Solution {
public:void connect(TreeLinkNode *root) {if(root == NULL) return;while(true) {TreeLinkNode *node=NULL, *temp=NULL;bool flag=false;for(; root!=NULL; root=root->next) {node = root->left;flag = false;if(node==NULL) {node = root->right;flag = true;}if(node!=NULL) break;}temp = node;int cnt=1;if(node==NULL) break;if(flag) {cnt++;root = root->next;}for(; root!=NULL; root=root->next) {if(cnt>1) {if(root->left!=NULL) {node->next = root->left;node = root->left;}}node->next = root->right;if(node->next!=NULL)node = node->next;cnt++;}root = temp;}return;}
}
这篇关于leetcode 117 Populating Next Right Pointers in Each Node II的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
