Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
64 lines (52 loc) · 1.5 KB

File metadata and controls

64 lines (52 loc) · 1.5 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package datatype;
public class TreeNode {
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val) {
this.val = val;
}
public TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
TreeNode constructFromArray(Integer[] vals, int k) {
if (k >= vals.length || vals[k] == null) {
return null;
}
TreeNode root = new TreeNode(vals[k]);
int leftIndex = 2 * k + 1;
root.left = constructFromArray(vals, leftIndex);
int rightIndex = 2 * k + 2;
root.right = constructFromArray(vals, rightIndex);
return root;
}
public TreeNode(Integer[] vals) {
if (vals.length == 0) {
left = null;
right = null;
}
val = vals[0];
left = constructFromArray(vals, 1);
right = constructFromArray(vals, 2);
}
@Override
public String toString() {
return "" + val;
}
void print_r(TreeNode node, int level, StringBuilder sb) {
if (node != null) {
print_r(node.right, level + 1, sb);
sb.append("\t".repeat(Math.max(0, level)));
sb.append(node.val);
sb.append("\n");
print_r(node.left, level + 1, sb);
}
}
public String prettyPrint() {
StringBuilder sb = new StringBuilder();
print_r(this, 0, sb);
return sb.toString();
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.