Merge pull request #881 from 0xff-dev/2331

Add solution and test-cases for problem 2331

Author: 6boris

leetcode/2301-2400/2331.Evaluate-Boolean-Binary-Tree/README.md

@@ -1,28 +1,42 @@
 # [2331.Evaluate Boolean Binary Tree][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You are given the `root` of a **full binary tree** with the following properties:
 
-**Example 1:**
+- **Leaf nodes** have either the value `0` or `1`, where `0` represents `False` and `1` represents `True`.
+- **Non-leaf nodes** have either the value `2` or `3`, where `2` represents the boolean `OR` and `3` represents the boolean `AND`.
 
-```
-Input: a = "11", b = "1"
-Output: "100"
-```
+The `evaluation` of a node is as follows:
+
+- If the node is a leaf node, the evaluation is the **value** of the node, i.e. `True` or `False`.
+- Otherwise, **evaluate** the node's two children and **apply** the boolean operation of its value with the children's evaluations.
+
+Return the boolean result of **evaluating** the `root` node.
+
+A **full binary** tree is a binary tree where each node has either `0` or `2` children.
 
-## 题意
-> ...
+A **leaf node** is a node that has zero children.
 
-## 题解
+**Example 1:**  
 
-### 思路1
-> ...
-Evaluate Boolean Binary Tree
-```go
+![1](./example1drawio1.png)
+
+```
+Input: root = [2,1,3,null,null,0,1]
+Output: true
+Explanation: The above diagram illustrates the evaluation process.
+The AND node evaluates to False AND True = False.
+The OR node evaluates to True OR False = True.
+The root node evaluates to True, so we return true.
 ```
 
+**Example 2:**
+
+```
+Input: root = [0]
+Output: false
+Explanation: The root node is a leaf node and it evaluates to false, so we return false.
+```
 
 ## 结语
 

leetcode/2301-2400/2331.Evaluate-Boolean-Binary-Tree/Solution.go

@@ -1,5 +1,24 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+type TreeNode struct {
+	Val         int
+	Left, Right *TreeNode
+}
+
+func Solution(root *TreeNode) bool {
+	if root == nil {
+		return true
+	}
+	if root.Val == 0 {
+		return false
+	}
+	if root.Val == 1 {
+		return true
+	}
+	l := Solution(root.Left)
+	r := Solution(root.Right)
+	if root.Val == 2 {
+		return l || r
+	}
+	return l && r
 }

leetcode/2301-2400/2331.Evaluate-Boolean-Binary-Tree/Solution_test.go

@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
+		inputs *TreeNode
 		expect bool
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", &TreeNode{Val: 2, Left: &TreeNode{Val: 1}, Right: &TreeNode{Val: 3, Left: &TreeNode{Val: 0}, Right: &TreeNode{Val: 1}}}, true},
+		{"TestCase", &TreeNode{Val: 0}, false},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }