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
Sign up
Appearance settings

Commit 6e51450

Browse files
removes TreeNode dependency
1 parent b1246c4 commit 6e51450

13 files changed

+3
-122
lines changed

‎src/BalancedBinaryTree.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,4 @@
11
public class BalancedBinaryTree {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
}
72

83
public static boolean isBalanced(TreeNode root) {
94
return height(root) != -1;

‎src/BinaryTreeLevelOrderTraversalII.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -5,11 +5,6 @@
55
import java.util.Queue;
66

77
public class BinaryTreeLevelOrderTraversalII {
8-
private static class TreeNode {
9-
int val;
10-
TreeNode left;
11-
TreeNode right;
12-
}
138

149
private static class Pair {
1510
TreeNode tree;

‎src/BinaryTreePaths.java

Lines changed: 1 addition & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -2,24 +2,10 @@
22
import java.util.List;
33

44
public class BinaryTreePaths {
5-
public static void main(String[] args) {
6-
String[] array = {"hello", "1", "2"};
7-
List<CharSequence> list = new ArrayList<>();
8-
list.add("1");
9-
list.add("2");
10-
list.add("3");
11-
System.out.println(String.join("->", list));
12-
}
13-
14-
private static class TreeNode {
15-
int val;
16-
TreeNode left;
17-
TreeNode right;
18-
}
195

206
public static List<String> binaryTreePaths(TreeNode root) {
217
List<String> result = new ArrayList<>();
22-
binaryTreePaths(root, new ArrayList<CharSequence>(), result);
8+
binaryTreePaths(root, new ArrayList<>(), result);
239
return result;
2410
}
2511

‎src/ConvertSortedArrayToBinarySearchTree.java

Lines changed: 0 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,4 @@
11
public class ConvertSortedArrayToBinarySearchTree {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
7-
TreeNode(int val) {
8-
this.val = val;
9-
}
10-
11-
TreeNode(int val, TreeNode left, TreeNode right) {
12-
this.val = val;
13-
this.left = left;
14-
this.right = right;
15-
}
16-
}
172

183
public static TreeNode sortedArrayToBST(int[] array) {
194
return sortedArrayToBST(array, 0, array.length);

‎src/FindModeInBinarySearchTree.java

Lines changed: 0 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -3,19 +3,6 @@
33
import java.util.List;
44

55
public class FindModeInBinarySearchTree {
6-
static class TreeNode {
7-
int val;
8-
TreeNode left;
9-
TreeNode right;
10-
TreeNode() {}
11-
TreeNode(int val) { this.val = val; }
12-
TreeNode(int val, TreeNode left, TreeNode right) {
13-
this.val = val;
14-
this.left = left;
15-
this.right = right;
16-
}
17-
}
18-
196
private static TreeNode previous;
207
private static int count = 1;
218
private static int mode = 0;

‎src/InvertBinaryTree.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,4 @@
11
public class InvertBinaryTree {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
}
72

83
public static TreeNode invertTree(TreeNode root) {
94
if (root == null) {

‎src/LowestCommonAncestorOfBinarySearchTree.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -2,11 +2,6 @@
22
import java.util.List;
33

44
public class LowestCommonAncestorOfBinarySearchTree {
5-
private static class TreeNode {
6-
int val;
7-
TreeNode left;
8-
TreeNode right;
9-
}
105

116
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
127
List<TreeNode> pathToP = pathTo(root, p);

‎src/MaximumDepthOfBinaryTree.java

Lines changed: 0 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,4 @@
11
public class MaximumDepthOfBinaryTree {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
}
7-
82
public int maxDepth(TreeNode root) {
93
if (root == null) {
104
return 0;

‎src/MinimumDepthOfBinaryTree.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,4 @@
11
public class MinimumDepthOfBinaryTree {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
}
72

83
public static int minDepth(TreeNode root) {
94
if (root == null) {

‎src/PathSum.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,4 @@
11
public class PathSum {
2-
private static class TreeNode {
3-
int val;
4-
TreeNode left;
5-
TreeNode right;
6-
}
72

83
public static boolean hasPathSum(TreeNode root, int sum) {
94
return root != null && hasPathSum(root, sum, root.val);

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /