We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4308b3c commit 9eaf070Copy full SHA for 9eaf070
src/leetcode2018/Trees.java
@@ -12,16 +12,16 @@ public static void main(String[] args){
12
t.left.left = new TreeNode(2);
13
t.left.right = new TreeNode(4);
14
t.right = new TreeNode(7);
15
- //t.right.left = new TreeNode(6);
16
- //t.right.right= new TreeNode(8);
+ t.right.left = new TreeNode(6);
+ t.right.right= new TreeNode(8);
17
test.inOrderTraversal(t);
18
System.out.println();
19
test.preOrderTraversal(t);
20
21
test.postOrderTraversal(t);
22
- //System.out.println(test.minDepth(t));
23
- //test.binaryTreePaths(t);
24
- //test.lowestCommonAncestor(t, t.left.left, t.left.right);
+ System.out.println(test.minDepth(t));
+ test.binaryTreePaths(t);
+ test.lowestCommonAncestor(t, t.left.left, t.left.right);
25
}
26
27
public int minDepth(TreeNode root) {
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments