LeetCode 116. Populating Next Right Pointers in Each Node
Solution1:我的答案
迭代版层次遍历
有个2B bug困扰了我好久
class Solution {
public:
void connect(TreeLinkNode *root) {
if (!root) return;
queue<TreeLinkNode* > my_queue;
my_queue.push(root);
int cur = 1, next = 0;
while (!my_queue.empty()) {
if (my_queue.front()->left) {
my_queue.push(my_queue.front()->left);
next++;
}
if (my_queue.front()->right) {
my_queue.push(my_queue.front()->right);
next++;
}
if (cur == 1) {//2B的我,写着2B的代码
my_queue.front()->next = NULL;
my_queue.pop();
cur--;
} else if (cur > 1) {
TreeLinkNode* temp = my_queue.front();
my_queue.pop();
temp->next = my_queue.front();
cur--;
}
if (cur == 0) {
cur = next;
next = 0;
}
}
return;
}
};
Solution2:
递归版层次遍历,参考网址:http://www.cnblogs.com/grandyang/p/4288151.html
这道题实际上是树的层序遍历的应用,可以参考之前的博客Binary Tree Level Order Traversal 二叉树层序遍历,既然是遍历,就有递归和非递归两种方法,最好两种方法都要掌握,都要会写。下面先来看递归的解法,由于是完全二叉树,所以若节点的左子结点存在的话,其右子节点必定存在,所以左子结点的next指针可以直接指向其右子节点,对于其右子节点的处理方法是,判断其父节点的next是否为空,若不为空,则指向其next指针指向的节点的左子结点,若为空则指向NULL,代码如下:
// Recursion, more than constant space
class Solution {
public:
void connect(TreeLinkNode *root) {
if (!root) return;
if (root->left) root->left->next = root->right;
if (root->right) root->right->next = root->next? root->next->left : NULL;
connect(root->left);
connect(root->right);
}
};
Solution3:
参考网址:http://www.cnblogs.com/grandyang/p/4288151.html
题目中要求用O(1)的空间复杂度,所以我们来看下面这种碉堡了的方法。用两个指针start和cur,其中start标记每一层的起始节点,cur用来遍历该层的节点,设计思路之巧妙,不得不服啊:
class Solution {
public:
void connect(TreeLinkNode *root) {
if (!root) return;
TreeLinkNode *start = root, *cur = NULL;
while (start->left) {
cur = start;
while (cur) {
cur->left->next = cur->right;
if (cur->next) cur->right->next = cur->next->left;
cur = cur->next;
}
start = start->left;
}
}
};