Populating Next Right Pointers in Each Node II
2013-06-30 11:54
190 查看
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,
After calling your function, the tree should look like:
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
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {} * }; */ class Solution { public: void findNextForLeft(TreeLinkNode *root){ if(!root || !root->left) return; TreeLinkNode *cur = root; TreeLinkNode *target = NULL; if(root -> right){ target = root -> right; }else{ while(cur -> next){ cur = cur -> next; if(cur -> left){ target = cur-> left; break; }else if(cur -> right){ target = cur -> right; break; } } } root -> left -> next = target; } void findNextForRight(TreeLinkNode *root){ if(!root || !root->right) return; TreeLinkNode *cur = root; TreeLinkNode *target = NULL; while(cur -> next){ cur = cur -> next; if(cur -> left){ target = cur-> left; break; }else if(cur -> right){ target = cur -> right; break; } } root -> right -> next = target; } void findNext(TreeLinkNode *root){ findNextForLeft(root); findNextForRight(root); } void connect(TreeLinkNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(!root) return; root -> next = NULL; queue<TreeLinkNode *> q; q.push(root); TreeLinkNode *cur; while(!q.empty()){ cur = q.front(); q.pop(); if(cur -> left) q.push(cur -> left); if(cur -> right) q.push(cur -> right); findNext(cur); } } };
相关文章推荐
- leetcode117~Populating Next Right Pointers in Each Node II
- LeetCode - Populating Next Right Pointers in Each Node I && II
- Populating Next Right Pointers in Each Node II 解答
- Leetcode 117 Populating Next Right Pointers in Each Node II 二叉树填充next指针指向右侧结点 II
- [Leetcode] Populating Next Right Pointers in Each Node II
- populating-next-right-pointers-in-each-node(i,ii)
- [Leetcode]Populating Next Right Pointers in Each Node I && II
- leetcode:Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II <leetcode>
- Populating Next Right Pointers in Each Node I, II
- 【Leetcode】Populating Next Right Pointers in Each Node II
- 【LeetCode with Python】 Populating Next Right Pointers in Each Node II
- leetcode_c++:树:Populating Next Right Pointers in Each Node II(117)
- 【LeetCode】Populating Next Right Pointers in Each Node I & II
- Populating Next Right Pointers in Each Node II
- leetcode 79: Populating Next Right Pointers in Each Node II
- 5.1.12 Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II -- leetcode
- [LeetCode][Java] Populating Next Right Pointers in Each Node II
- 【leetcode刷题笔记】Populating Next Right Pointers in Each Node II