117. Populating Next Right Pointers in Each Node II

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

题目含义：从左到右连接每一层的节点

 1     public void connect(TreeLinkNode root) {
 2         while(root != null){
 3             TreeLinkNode tempChild = new TreeLinkNode(0);
 4             TreeLinkNode currentChild = tempChild;
 5             while(root!=null){
 6                 if(root.left != null) { currentChild.next = root.left; currentChild = currentChild.next;}
 7                 if(root.right != null) { currentChild.next = root.right; currentChild = currentChild.next;}
 8                 root = root.next;
 9             }
10             root = tempChild.next;
11         }
12     }

转载于:https://www.cnblogs.com/wzj4858/p/7715047.html

117. Populating Next Right Pointers in Each Node II相关推荐

【To Understand!】LeetCode 117. Populating Next Right Pointers in Each Node II
LeetCode 117. Populating Next Right Pointers in Each Node II Solution1:我的答案层次遍历 /*** Definition for ...
117 Populating Next Right Pointers in Each Node II
117 Populating Next Right Pointers in Each Node II 就是 Bibary Tree Level order Traverse class Solutio ...
LeetCode 117. Populating Next Right Pointers in Each Node II
原题链接在这里:https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ 题目: Given a bi ...
117. Populating Next Right Pointers in Each Node II 计算右边的附属节点
［抄题］: Given a binary tree struct TreeLinkNode {TreeLinkNode *left;TreeLinkNode *right;TreeLinkNode * ...
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...
Leetcode: Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree ...
leetcode - Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...
LeetCode OJ - Populating Next Right Pointers in Each Node II
题目: Follow up for problem "Populating Next Right Pointers in Each Node". What if the given ...
[Leetcode][JAVA] Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tre ...

117. Populating Next Right Pointers in Each Node II

117. Populating Next Right Pointers in Each Node II相关推荐

最新文章

热门文章