solve leetcode 1331

Author: pymongo

Diff for: README.md

@@ -568,6 +568,7 @@ leetcode_solutions
 |2299|[Strong Password Checker II](https://leetcode.cn/problems/strong-password-checker-ii/)|[Rust](src/easy/leetcode_very_easy.rs)|
 |2319|[Check If Matrix...](https://leetcode.cn/problems/check-if-matrix-is-x-matrix/)|[Rust](src/easy/leetcode_very_easy.rs)|
 |2325|[Decode The Message](https://leetcode.cn/problems/decode-the-message/)|[Rust](src/easy/leetcode_very_easy.rs)|
+|2331|[Evaluate Boolean Binary Tree](https://leetcode.cn/problems/evaluate-boolean-binary-tree/)|[Rust](src/binary_tree/evaluate_boolean_binary_tree.rs)|
 
 ---
 

Diff for: src/binary_tree/evaluate_boolean_binary_tree.rs

@@ -0,0 +1,17 @@
+use super::prelude::*;
+
+/// https://leetcode.cn/problems/evaluate-boolean-binary-tree/
+fn evaluate_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
+    let root = root.unwrap();
+    let root = root.borrow();
+    if root.left.is_none() && root.right.is_none() {
+        return root.val == 1;
+    }
+    let left = evaluate_tree(root.left.clone());
+    let right = evaluate_tree(root.right.clone());
+    if root.val == 2 {
+        left || right
+    } else {
+        left && right
+    }
+}

Diff for: src/binary_tree/mod.rs

@@ -1,3 +1,4 @@
+mod evaluate_boolean_binary_tree;
 #[cfg(feature = "rustc_private")]
 mod graphviz_view_leetcode_binary_tree;
 mod invert_binary_tree;