[leetcode] Populating Next Right Pointers in Each Node II

最新推荐文章于 2021-09-24 12:05:40 发布

原创最新推荐文章于 2021-09-24 12:05:40 发布 · 618 阅读

0 ·

CC 4.0 BY-SA版权

算法题专栏收录该内容

107 篇文章

订阅专栏

本文讨论了如何在不使用额外空间的情况下，解决任意二叉树中节点的链接问题，通过遍历二叉树并调整节点的next指针实现每一层节点的链接。

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

class Solution {
public:
    void connect(TreeLinkNode *root) {
		// Start typing your C/C++ solution below
		// DO NOT write int main() function
        if(!root)
            return;
		TreeLinkNode** array=new TreeLinkNode*[10000];
		array[0]=root;
		int p,q,flag;
		for(p=0,q=1,flag=1 ; p!=q ; p++ ){
			if(p==flag){
				for(int i=p ; i<q-1 ; i++){
					array[i]->next=array[i+1];
				}
				flag=q;
			}
			if(array[p]->left)
				array[q++]=array[p]->left;
			if(array[p]->right)
				array[q++]=array[p]->right;
		}
	}
};