Description
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 1:
Input: root = [1,2,3,4,5,null,7]
Output: [1,#,2,3,#,4,5,7,#]
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. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
Example 2:
Input: root = []
Output: []
Constraints:
- The number of nodes in the tree is in the range
[0, 6000].
-100 <= Node.val <= 100
Follow-up:
- You may only use constant extra space.
- The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.
Solutions
Solution 1: BFS
We use a queue q for level order traversal. Each time we traverse a level, we connect the nodes of the current level in order.
The time complexity is O(n), and the space complexity is O(n). Here, n is the number of nodes in the binary tree.
PythonJavaC++GoTypeScriptC#
"""
# Definition for a Node.
class Node:
def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
self.val = val
self.left = left
self.right = right
self.next = next
"""
class Solution:
def connect(self, root: "Node") -> "Node":
if root is None:
return root
q = deque([root])
while q:
p = None
for _ in range(len(q)):
node = q.popleft()
if p:
p.next = node
p = node
if node.left:
q.append(node.left)
if node.right:
q.append(node.right)
return root(code-box)
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
if (root == null) {
return root;
}
Deque<Node> q = new ArrayDeque<>();
q.offerLast(root);
while (!q.isEmpty()) {
Node p = null;
for (int n = q.size(); n > 0; --n) {
Node node = q.pollFirst();
if (p != null) {
p.next = node;
}
p = node;
if (node.left != null) {
q.offerLast(node.left);
}
if (node.right != null) {
q.offerLast(node.right);
}
}
}
return root;
}
}(code-box)
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
Node* connect(Node* root) {
if (!root) {
return root;
}
queue<Node*> q{{root}};
while (!q.empty()) {
Node* p = nullptr;
for (int n = q.size(); n; --n) {
Node* node = q.front();
q.pop();
if (p) {
p->next = node;
}
p = node;
if (node->left) {
q.push(node->left);
}
if (node->right) {
q.push(node->right);
}
}
}
return root;
}
};(code-box)
/**
* Definition for a Node.
* type Node struct {
* Val int
* Left *Node
* Right *Node
* Next *Node
* }
*/
func connect(root *Node) *Node {
if root == nil {
return root
}
q := []*Node{root}
for len(q) > 0 {
var p *Node
for n := len(q); n > 0; n-- {
node := q[0]
q = q[1:]
if p != nil {
p.Next = node
}
p = node
if node.Left != nil {
q = append(q, node.Left)
}
if node.Right != nil {
q = append(q, node.Right)
}
}
}
return root
}(code-box)
/**
* Definition for Node.
* class Node {
* val: number
* left: Node | null
* right: Node | null
* next: Node | null
* constructor(val?: number, left?: Node, right?: Node, next?: Node) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function connect(root: Node | null): Node | null {
if (!root) {
return null;
}
const q: Node[] = [root];
while (q.length) {
const nq: Node[] = [];
let p: Node | null = null;
for (const node of q) {
if (p) {
p.next = node;
}
p = node;
const { left, right } = node;
left && nq.push(left);
right && nq.push(right);
}
q.splice(0, q.length, ...nq);
}
return root;
}(code-box)
/*
// Definition for a Node.
public class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
}
*/
public class Solution {
public Node Connect(Node root) {
if (root == null) {
return null;
}
var q = new Queue<Node>();
q.Enqueue(root);
while (q.Count > 0) {
Node p = null;
for (int i = q.Count; i > 0; --i) {
var node = q.Dequeue();
if (p != null) {
p.next = node;
}
p = node;
if (node.left != null) {
q.Enqueue(node.left);
}
if (node.right != null) {
q.Enqueue(node.right);
}
}
}
return root;
}
}(code-box)
Solution 2: Space Optimization
The space complexity of Solution 1 is relatively high because it requires a queue to store the nodes of each level. We can implement it with constant space.
We define two pointers prev and next, which point to the previous node and the first node of the next level, respectively. When traversing the nodes of the current level, we string the nodes of the next level together and find the first node of the next level. After the current level is traversed, we assign the first node next of the next level to node and continue to traverse.
The time complexity is O(n), where n is the number of nodes in the binary tree. The space complexity is O(1).
PythonJavaC++GoTypeScriptC#
"""
# Definition for a Node.
class Node:
def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
self.val = val
self.left = left
self.right = right
self.next = next
"""
class Solution:
def connect(self, root: 'Node') -> 'Node':
def modify(curr):
nonlocal prev, next
if curr is None:
return
next = next or curr
if prev:
prev.next = curr
prev = curr
node = root
while node:
prev = next = None
while node:
modify(node.left)
modify(node.right)
node = node.next
node = next
return root(code-box)
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
private Node prev, next;
public Node connect(Node root) {
Node node = root;
while (node != null) {
prev = null;
next = null;
while (node != null) {
modify(node.left);
modify(node.right);
node = node.next;
}
node = next;
}
return root;
}
private void modify(Node curr) {
if (curr == null) {
return;
}
if (next == null) {
next = curr;
}
if (prev != null) {
prev.next = curr;
}
prev = curr;
}
}(code-box)
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
Node* connect(Node* root) {
Node* node = root;
Node* prev = nullptr;
Node* next = nullptr;
auto modify = [&](Node* curr) {
if (!curr) {
return;
}
if (!next) {
next = curr;
}
if (prev) {
prev->next = curr;
}
prev = curr;
};
while (node) {
prev = next = nullptr;
while (node) {
modify(node->left);
modify(node->right);
node = node->next;
}
node = next;
}
return root;
}
};(code-box)
/**
* Definition for a Node.
* type Node struct {
* Val int
* Left *Node
* Right *Node
* Next *Node
* }
*/
func connect(root *Node) *Node {
node := root
var prev, next *Node
modify := func(curr *Node) {
if curr == nil {
return
}
if next == nil {
next = curr
}
if prev != nil {
prev.Next = curr
}
prev = curr
}
for node != nil {
prev, next = nil, nil
for node != nil {
modify(node.Left)
modify(node.Right)
node = node.Next
}
node = next
}
return root
}(code-box)
/**
* Definition for Node.
* class Node {
* val: number
* left: Node | null
* right: Node | null
* next: Node | null
* constructor(val?: number, left?: Node, right?: Node, next?: Node) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function connect(root: Node | null): Node | null {
const modify = (curr: Node | null): void => {
if (!curr) {
return;
}
next = next || curr;
if (prev) {
prev.next = curr;
}
prev = curr;
};
let node = root;
let [prev, next] = [null, null];
while (node) {
while (node) {
modify(node.left);
modify(node.right);
node = node.next;
}
node = next;
[prev, next] = [null, null];
}
return root;
}(code-box)
/*
// Definition for a Node.
public class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
}
*/
public class Solution {
private Node prev, next;
public Node Connect(Node root) {
Node node = root;
while (node != null) {
prev = null;
next = null;
while (node != null) {
modify(node.left);
modify(node.right);
node = node.next;
}
node = next;
}
return root;
}
private void modify(Node curr) {
if (curr == null) {
return;
}
if (next == null) {
next = curr;
}
if (prev != null) {
prev.next = curr;
}
prev = curr;
}
}(code-box)
