LeetCode 117:Populating Next Right Pointers in Each Node II

最新推荐文章于 2020-04-22 15:32:42 发布

zhihua_bupt

最新推荐文章于 2020-04-22 15:32:42 发布

阅读量1.9k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode C++ DataStructure&Algorithms LeetCode算法分析

本文链接：https://blog.csdn.net/geekmanong/article/details/50439036

C++ 同时被 3 个专栏收录

133 篇文章

订阅专栏

DataStructure&Algorithms

131 篇文章

订阅专栏

LeetCode算法分析

128 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下，填充二叉树中每个节点的下一个右侧指针的方法。通过层次遍历的方式，当检测到底层还有子节点时，继续遍历并填充指针。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \    \
    4-> 5 -> 7 -> NULL

Subscribe to see which companies asked this question

//二叉树进行层次遍历
//判断最底层的条件：如果当前访问的层有任一节点存在子节点，说明当前层不是最底层。
class Solution{
public:
	TreeLinkNode* nextLeft;
	bool hasToTheEnd;
	void connect(TreeLinkNode *root)
	{
		if (!root)  return;

		hasToTheEnd = false;
		int level = 1;
		while (!hasToTheEnd)
		{
			hasToTheEnd= true;
			nextLeft= NULL;
			VisitLevel(root, level);
			++level;
		}
	}

	void VisitLevel(TreeLinkNode* node, int level)
	{
		if (level == 1)
		{
			if (nextLeft != NULL)
			{
				nextLeft->next = node;
			}
			nextLeft = node;

			if (node->left != NULL || node->right != NULL)
			{
				hasToTheEnd= false;
			}
		}

		if (node->left)	  VisitLevel(node->left, level - 1);
		if (node->right)  VisitLevel(node->right, level - 1);
	}
};