Commit04eaece

committed

refactor 100

1 parent79911eb commit04eaeceCopy full SHA for 04eaece

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,6 +7,36 @@`
`7`	`7`	`*`
`8`	`8`	`* Given two binary trees, write a function to check if they are equal or not. Two binary trees are`
`9`	`9`	`* considered equal if they are structurally identical and the nodes have the same value.`
	`10`	`+ *`
	`11`	`+ * Example 1:`
	`12`	`+ *`
	`13`	`+ * Input: 1 1`
	`14`	`+ * / \ / \`
	`15`	`+ * 2 3 2 3`
	`16`	`+ *`
	`17`	`+ * [1,2,3], [1,2,3]`
	`18`	`+ *`
	`19`	`+ * Output: true`
	`20`	`+ *`
	`21`	`+ * Example 2:`
	`22`	`+ *`
	`23`	`+ * Input: 1 1`
	`24`	`+ * / \`
	`25`	`+ * 2 2`
	`26`	`+ *`
	`27`	`+ * [1,2], [1,null,2]`
	`28`	`+ *`
	`29`	`+ * Output: false`
	`30`	`+ *`
	`31`	`+ * Example 3:`
	`32`	`+ *`
	`33`	`+ * Input: 1 1`
	`34`	`+ * / \ / \`
	`35`	`+ * 2 1 1 2`
	`36`	`+ *`
	`37`	`+ * [1,2,1], [1,1,2]`
	`38`	`+ *`
	`39`	`+ * Output: false`
`10`	`40`	`*/`
`11`	`41`
`12`	`42`	`publicclass_100 {`

Comments

(0)