[LeetCode73]Populating Next Right Pointers in Each Node II

1884 단어 LeetCodetreebinary
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,
         1
       /  \
      2    3
     / \    \
    4   5    7

After calling your function, the tree should look like:
         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \    \
    4-> 5 -> 7 -> NULL

Analysis:
이전 문제와 유사하게 유일한 차이점은 매번 첫 번째 유효한next 링크 노드를 찾고 귀속할 때 오른쪽 트리를 먼저 처리하고 왼쪽 트리를 처리하는 것이다.
Java
public void connect(TreeLinkNode root) {
        if(root ==null) return;
        TreeLinkNode p = root.next;
        while(p!=null){
        	if(p.left!=null){
        		p = p.left;
        		break;
        	}
        	if(p.right!=null){
        		p = p.right;
        		break;
        	}
        	p = p.next;
        }
        if(root.right!=null)
        	root.right.next = p;
        if(root.left!=null)
        	root.left.next = root.right != null ? root.right:p;
        connect(root.right);
        connect(root.left);
    }

c++
void connect(TreeLinkNode *root) {
        if(root == NULL) return;
     TreeLinkNode *p = root->next;
     while(p != NULL){
        if(p->left != NULL){
            p = p->left;
            break;
        }
        if(p->right != NULL){
            p = p->right;
            break;
        }
        p = p->next;
     }
     if(root->right != NULL){
        root->right->next = p;
     }
     if(root->left != NULL){
        root->left->next = root->right ? root->right : p;
     }
     connect(root->right);
     connect(root->left);
    }

좋은 웹페이지 즐겨찾기