Populating Next Right Pointers in Each Node II
2014-01-28 09:24
302 查看
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 connect(TreeLinkNode *root) { while (root) { TreeLinkNode * next = NULL; // the first node of next level TreeLinkNode * prev = NULL; // previous node on the same level for (; root; root=root->next) { if (!next) next = root->left?root->left:root->right; if (root->left) { if (prev) prev->next = root->left; prev = root->left; } if (root->right) { if (prev) prev->next = root->right; prev = root->right; } } root = next; // turn to next level } } };
相关文章推荐
- 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 II
- [LeetCode] Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II (LeetCode)
- [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 II
- Populating Next Right Pointers in Each Node I&II
- [LeetCode] 076: Populating Next Right Pointers in Each Node 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 II
- leetcode || 117、Populating Next Right Pointers in Each Node II
- leetcode第一刷_Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- 70:Populating Next Right Pointers in Each Node 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 II