feat: add rust solution to lc problem: No.0226 (doocs#1277)

Author: xzhseh

solution/0200-0299/0226.Invert Binary Tree/README.md

@@ -223,6 +223,49 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+impl Solution {
+    #[allow(dead_code)]
+    pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        if root.is_none() {
+            return root;
+        }
+        let left = root.as_ref().unwrap().borrow().left.clone();
+        let right = root.as_ref().unwrap().borrow().right.clone();
+        // Invert the subtree
+        let inverted_left = Self::invert_tree(right);
+        let inverted_right = Self::invert_tree(left);
+        // Update the left & right
+        root.as_ref().unwrap().borrow_mut().left = inverted_left;
+        root.as_ref().unwrap().borrow_mut().right = inverted_right;
+        // Return the root
+        root
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0226.Invert Binary Tree/README_EN.md

@@ -205,6 +205,49 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+impl Solution {
+    #[allow(dead_code)]
+    pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        if root.is_none() {
+            return root;
+        }
+        let left = root.as_ref().unwrap().borrow().left.clone();
+        let right = root.as_ref().unwrap().borrow().right.clone();
+        // Invert the subtree
+        let inverted_left = Self::invert_tree(right);
+        let inverted_right = Self::invert_tree(left);
+        // Update the left & right
+        root.as_ref().unwrap().borrow_mut().left = inverted_left;
+        root.as_ref().unwrap().borrow_mut().right = inverted_right;
+        // Return the root
+        root
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0226.Invert Binary Tree/Solution.rs

@@ -0,0 +1,38 @@
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+impl Solution {
+    #[allow(dead_code)]
+    pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        if root.is_none() {
+            return root;
+        }
+        let left = root.as_ref().unwrap().borrow().left.clone();
+        let right = root.as_ref().unwrap().borrow().right.clone();
+        // Invert the subtree
+        let inverted_left = Self::invert_tree(right);
+        let inverted_right = Self::invert_tree(left);
+        // Update the left & right
+        root.as_ref().unwrap().borrow_mut().left = inverted_left;
+        root.as_ref().unwrap().borrow_mut().right = inverted_right;
+        // Return the root
+        root
+    }
+}