feat: 0110.Balanced-Binary-Tree

Author: kimi0230

Leetcode/0110.Balanced-Binary-Tree/README.md

@@ -139,7 +139,6 @@ func IsBalanced(root *TreeNode) bool {
 	leftHight := depth(root.Left)
 	rightHight := depth(root.Right)
 
-	// return abs(leftHight-rightHight) <= 1
 	return abs(leftHight-rightHight) <= 1 && IsBalanced(root.Left) && IsBalanced(root.Right)
 }
 

Leetcode/0110.Balanced-Binary-Tree/main.go

@@ -23,7 +23,6 @@ func IsBalanced(root *TreeNode) bool {
 	leftHight := depth(root.Left)
 	rightHight := depth(root.Right)
 
-	// return abs(leftHight-rightHight) <= 1
 	return abs(leftHight-rightHight) <= 1 && IsBalanced(root.Left) && IsBalanced(root.Right)
 }
 

Leetcode/0110.Balanced-Binary-Tree/main_test.go

@@ -13,6 +13,14 @@ var tests = []struct {
 		[]int{1, 2, 2, 3, structures.NULL, structures.NULL, 3, 4, structures.NULL, structures.NULL, 4},
 		false,
 	},
+	{
+		[]int{1, 2, 2, 3, structures.NULL, structures.NULL, 3, 4, structures.NULL, structures.NULL, 4},
+		false,
+	},
+	{
+		[]int{3, 9, 20, structures.NULL, structures.NULL, 15, 7},
+		true,
+	},
 }
 
 func TestIsBalanced(t *testing.T) {