Commite755039

committed

Update

1 parenta86f06e commite755039Copy full SHA for e755039

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -91,6 +91,8 @@`
`91`	`91`	`*[二叉树：我对称么？](https://mp.weixin.qq.com/s/Kgf0gjvlDlNDfKIH2b1Oxg)`
`92`	`92`	`*[二叉树：看看这些树的最大深度](https://mp.weixin.qq.com/s/guKwV-gSNbA1CcbvkMtHBg)`
`93`	`93`	`*[二叉树：看看这些树的最小深度](https://mp.weixin.qq.com/s/BH8-gPC3_QlqICDg7rGSGA)`
	`94`	`+*[二叉树：我有多少个节点？](https://mp.weixin.qq.com/s/2_eAjzw-D0va9y4RJgSmXw)`
	`95`	`+*[二叉树：我平衡么？](https://mp.weixin.qq.com/s/isUS-0HDYknmC0Rr4R8mww)`
`94`	`96`
`95`	`97`
`96`	`98`	`（持续更新中....）`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -89,8 +89,8 @@ public:`
`89`	`89`
`90`	`90`	`// 此时就是：左右节点都不为空，且数值相同的情况`
`91`	`91`	`// 此时才做递归，做下一层的判断`
`92`		`- bool outside = compare(left->left, right->right); // 左子树：左、右子树：右`
`93`		`- bool inside = compare(left->right, right->left); // 左子树：右、右子树：左`
	`92`	`+ bool outside = compare(left->left, right->right); // 左子树：左、右子树：左`
	`93`	`+ bool inside = compare(left->right, right->left); // 左子树：右、右子树：右`
`94`	`94`	`bool isSame = outside && inside; // 左子树：中、右子树：中（逻辑处理）`
`95`	`95`	`return isSame;`
`96`	`96`

Comments

(0)