-
Notifications
You must be signed in to change notification settings - Fork 56
/
Solution.java
47 lines (40 loc) · 1.12 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
package g0101_0200.s0116_populating_next_right_pointers_in_each_node;
// #Medium #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
// #Linked_List #Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search
// #2022_06_23_Time_0_ms_(100.00%)_Space_47.8_MB_(30.30%)
import com_github_leetcode.left_right.Node;
/*
// 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;
}
};
*/
public class Solution {
public Node connect(Node root) {
if (root == null) {
return null;
}
if (root.left != null && root.right != null) {
root.left.next = root.right;
}
if (root.next != null && root.right != null) {
root.right.next = root.next.left;
}
connect(root.left);
connect(root.right);
return root;
}
}