Commit433c62a

committed

Updated Lowest Common Ancestor of a Binary Tree.java

1 parent2a5879f commit433c62aCopy full SHA for 433c62a

File tree

+16

-10

lines changed

+16

-10

lines changed

Lines changed: 16 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,15 +8,21 @@`
`8`	`8`	`* }`
`9`	`9`	`*/`
`10`	`10`	`classSolution {`
`11`		`-publicTreeNodelowestCommonAncestor(TreeNoderoot,TreeNodep,TreeNodeq) {`
`12`		`-if (root ==null \|\|root ==p \|\|root ==q) {`
`13`		`-returnroot;`
	`11`	`+publicTreeNodelowestCommonAncestor(TreeNoderoot,TreeNodep,TreeNodeq) {`
	`12`	`+if (root ==null) {`
	`13`	`+returnnull;`
	`14`	`+ }`
	`15`	`+if (root ==p \|\|root ==q) {`
	`16`	`+returnroot;`
	`17`	`+ }`
	`18`	`+TreeNodeleft =lowestCommonAncestor(root.left,p,q);`
	`19`	`+TreeNoderight =lowestCommonAncestor(root.right,p,q);`
	`20`	`+if (left !=null &&right !=null) {`
	`21`	`+returnroot;`
	`22`	`+ }`
	`23`	`+if (left !=null \|\|right !=null) {`
	`24`	`+returnleft !=null ?left :right;`
	`25`	`+ }`
	`26`	`+returnnull;`
`14`	`27`	`}`
`15`		`-TreeNodeleftRoot =lowestCommonAncestor(root.left,p,q);`
`16`		`-TreeNoderightRoot =lowestCommonAncestor(root.right,p,q);`
`17`		`-if (leftRoot !=null &&rightRoot !=null) {`
`18`		`-returnroot;`
`19`		`- }`
`20`		`-returnleftRoot !=null ?leftRoot :rightRoot;`
`21`		`- }`
`22`	`28`	`}`

Comments

(0)