add 700

Author: luliyucoordinate

README.md

@@ -303,8 +303,9 @@ LeetCode
 |0684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | c | [c++](./src/0684-Redundant-Connection/0684.cpp) |[python](./src/0684-Redundant-Connection/0684.py)|||||Medium|
 |0687|[Longest Univalue Path](https://leetcode.com/problems/redundant-connection/) | c | [c++](./src/0687-Longest-Univalue-Path/0687.cpp) |[python](./src/0687-Longest-Univalue-Path/0687.py)|||||Easy|
 |0695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)|c|[c++](./src/0695-Max-Area-of-Island/0695.cpp)|[python](./src/0695-Max-Area-of-Island/0695.py)|[go](./src/0695-Max-Area-of-Island/0695.go)|[js](./src/0695-Max-Area-of-Island/0695.js)|[java](./src/0695-Max-Area-of-Island/0695.java)||Medium|
-|0697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)|c|[c++](./src/0697-Degree-of-an-Array/0697.cpp)|python|go|js|java||Easy|
+|0697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)||[c++](./src/0697-Degree-of-an-Array/0697.cpp)||||||Easy|
 |0698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)|c|[c++](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.cpp)|[python](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.py)|[go](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.go)|[js](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.js)|[java](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.java)||Medium|
+|0700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)||[c++](./src/0700-Search-in-a-Binary-Search-Tree/0700.cpp)|||||[rust](./src/0700-Search-in-a-Binary-Search-Tree/0700.rs)|Easy|
 |0733|[Flood Fill](https://leetcode.com/problems/flood-fill/) | c | [c++](./src/0733-Flood-Fill/0733.cpp) |[python](./src/0733-Flood-Fill/0733.py)|||||Easy|
 |0739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | c | [c++](./src/0739-Daily-Temperatures/0739.cpp) |[python](./src/0739-Daily-Temperatures/0739.py)|||||Medium|
 |0742|[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/) | c | [c++](./src/0742-Closest-Leaf-in-a-Binary-Tree/0742.cpp) |[python](./src/0742-Closest-Leaf-in-a-Binary-Tree/0742.py)|||||Medium|

src/0700-Search-in-a-Binary-Search-Tree/0700.cpp

@@ -0,0 +1,12 @@
+class Solution {
+ public:
+  TreeNode *searchBST(TreeNode *root, int val) {
+    if (root == nullptr) {
+      return nullptr;
+    }
+    if (val == root->val) {
+      return root;
+    }
+    return searchBST(val < root->val ? root->left : root->right, val);
+  }
+};

src/0700-Search-in-a-Binary-Search-Tree/0700.rs

@@ -0,0 +1,20 @@
+use std::cell::RefCell;
+use std::cmp::Ordering;
+use std::rc::Rc;
+impl Solution {
+    pub fn search_bst(
+        root: Option<Rc<RefCell<TreeNode>>>,
+        val: i32,
+    ) -> Option<Rc<RefCell<TreeNode>>> {
+        if let Some(t) = root {
+            let v = t.borrow().val;
+            match v.cmp(&val) {
+                Ordering::Equal => Some(t),
+                Ordering::Greater => Self::search_bst(t.borrow_mut().left.take(), val),
+                Ordering::Less => Self::search_bst(t.borrow_mut().right.take(), val),
+            }
+        } else {
+            None
+        }
+    }
+}