@@ -12,8 +12,8 @@ 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 );
@@ -84,14 +84,17 @@ public void postOrderTraversal(TreeNode t){
8484 }
8585
8686 public TreeNode lowestCommonAncestor (TreeNode root , TreeNode p , TreeNode q ) {
87- if (root ==null || root ==p || q == root ) return root ; System .out .println (root .val );
88- TreeNode left = lowestCommonAncestor (root .left , p , q );
89- TreeNode right = lowestCommonAncestor (root .right , p , q );
90- if (left != null && right !=null ) { System .out .println ("mid:" +root .val ); return root ;};
91- System .out .println ("left" +left + " right:" +right );
92- TreeNode re = left !=null ? left : right ;
93- return re ;
94- }
87+ if (root ==null || root ==p || q == root ) return root ; System .out .println (root .val );
88+ TreeNode left = lowestCommonAncestor (root .left , p , q );
89+ TreeNode right = lowestCommonAncestor (root .right , p , q );
90+ if (left != null && right !=null ) {
91+ System .out .println ("mid:" +root .val );
92+ return root ;
93+ };
94+ System .out .println ("left" +left + " right:" +right );
95+ TreeNode re = left !=null ? left : right ;
96+ return re ;
97+ }
9598
9699}
97100
0 commit comments