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 9eaf070

Browse files
Trees
1 parent 4308b3c commit 9eaf070

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

‎src/leetcode2018/Trees.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -12,16 +12,16 @@ public static void main(String[] args){
1212
t.left.left = new TreeNode(2);
1313
t.left.right = new TreeNode(4);
1414
t.right = new TreeNode(7);
15-
//t.right.left = new TreeNode(6);
16-
//t.right.right= new TreeNode(8);
15+
t.right.left = new TreeNode(6);
16+
t.right.right= new TreeNode(8);
1717
test.inOrderTraversal(t);
1818
System.out.println();
1919
test.preOrderTraversal(t);
2020
System.out.println();
2121
test.postOrderTraversal(t);
22-
//System.out.println(test.minDepth(t));
23-
//test.binaryTreePaths(t);
24-
//test.lowestCommonAncestor(t, t.left.left, t.left.right);
22+
System.out.println(test.minDepth(t));
23+
test.binaryTreePaths(t);
24+
test.lowestCommonAncestor(t, t.left.left, t.left.right);
2525
}
2626

2727
public int minDepth(TreeNode root) {

0 commit comments

Comments
(0)

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