Commitf0aed18

applewjg

committed

Same Tree

Change-Id: I2ab046652c7fcf933ba91566d40ba686a5deab05

1 parent99971b3 commitf0aed18Copy full SHA for f0aed18

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+/*`
	`2`	`+ Author: King, wangjingui@outlook.com`
	`3`	`+ Date: Dec 25, 2014`
	`4`	`+ Problem: Same Tree`
	`5`	`+ Difficulty: easy`
	`6`	`+ Source: http://leetcode.com/onlinejudge#question_100`
	`7`	`+ Notes:`
	`8`	`+ Given two binary trees, write a function to check if they are equal or not.`
	`9`	`+ Two binary trees are considered equal if they are structurally identical and the nodes have the same value.`
	`10`	`+`
	`11`	`+ Solution: recursion.`
	`12`	`+ */`
	`13`	`+/**`
	`14`	`+ * Definition for binary tree`
	`15`	`+ * public class TreeNode {`
	`16`	`+ * int val;`
	`17`	`+ * TreeNode left;`
	`18`	`+ * TreeNode right;`
	`19`	`+ * TreeNode(int x) { val = x; }`
	`20`	`+ * }`
	`21`	`+ */`
	`22`	`+publicclassSolution {`
	`23`	`+publicbooleanisSameTree(TreeNodep,TreeNodeq) {`
	`24`	`+if (p ==null &&q ==null)returntrue;`
	`25`	`+if ((p !=null &&q ==null) \|\| (p ==null &&q !=null))returnfalse;`
	`26`	`+if (p.val !=q.val)returnfalse;`
	`27`	`+returnisSameTree(p.left,q.left) &&isSameTree(p.right,q.right);`
	`28`	`+ }`
	`29`	`+}`

Comments

(0)