LeetCode 117. Populating Next Right Pointers in Each Node II

原题链接在这里：https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/

题目：

Given a binary tree

struct Node {int val;Node *left;Node *right;Node *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Example:

Input: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":null,"next":null,"right":{"$id":"6","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}Output: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":null,"right":null,"val":7},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"6","left":null,"next":null,"right":{"$ref":"5"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"6"},"val":1}Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.

Note:

You may only use constant extra space.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

题解：

是Populating Next Right Pointers in Each Node的进阶版.

Iteration解法相同.

Time Complexity: O(n). Space: O(1).

AC Java:

 1 /*
 2 // Definition for a Node.
 3 class Node {
 4     public int val;
 5     public Node left;
 6     public Node right;
 7     public Node next;
 8
 9     public Node() {}
10
11     public Node(int _val,Node _left,Node _right,Node _next) {
12         val = _val;
13         left = _left;
14         right = _right;
15         next = _next;
16     }
17 };
18 */
19 class Solution {
20     public Node connect(Node root) {
21         Node cur = root;
22         while(cur != null){
23             Node dummyHead = new Node(); //记录下一层的假头
24             Node it = dummyHead;
25
26             while(cur != null){
27                 if(cur.left != null){
28                     it.next = cur.left;
29                     it = it.next;
30                 }
31
32                 if(cur.right != null){
33                     it.next = cur.right;
34                     it = it.next;
35                 }
36
37                 cur = cur.next;  //cur 更新到下一层假头的next上面
38             }
39
40             cur = dummyHead.next;
41         }
42
43         return root;
44     }
45 }

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/4824975.html

LeetCode 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 ...
117. 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 计算右边的附属节点
［抄题］: Given a binary tree struct TreeLinkNode {TreeLinkNode *left;TreeLinkNode *right;TreeLinkNode * ...
LeetCode 116. Populating Next Right Pointers in Each Node
LeetCode 116. Populating Next Right Pointers in Each Node Solution1:我的答案迭代版层次遍历有个2B bug困扰了我好久 clas ...
[Leetcode Week15]Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each Node 题解原创文章,拒绝转载题目来源:https://leetcode.com/problems/populati ...
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 117. Populating Next Right Pointers in Each Node II

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

最新文章

热门文章