feat: add solutions to lc problem: No.0094

No.0094.Binary Tree Inorder Traversal

Author: YangFong

solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md

@@ -482,6 +482,202 @@ func inorderTraversal(root *TreeNode) []int {
 }
 ```
 
+### **TypeScript**
+
+递归：
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function inorderTraversal(root: TreeNode | null): number[] {
+    if (root == null) {
+        return [];
+    }
+    return [
+        ...inorderTraversal(root.left),
+        root.val,
+        ...inorderTraversal(root.right),
+    ];
+}
+```
+
+迭代：
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function inorderTraversal(root: TreeNode | null): number[] {
+    const res = [];
+    const stack = [];
+    while (root != null || stack.length != 0) {
+        if (root != null) {
+            stack.push(root);
+            root = root.left;
+        } else {
+            const { val, right } = stack.pop();
+            res.push(val);
+            root = right;
+        }
+    }
+    return res;
+}
+```
+
+Morris 遍历：
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function inorderTraversal(root: TreeNode | null): number[] {
+    const res = [];
+    while (root != null) {
+        const { val, left, right } = root;
+        if (left == null) {
+            res.push(val);
+            root = right;
+        } else {
+            let mostRight = left;
+            while (mostRight.right != null && mostRight.right != root) {
+                mostRight = mostRight.right;
+            }
+            if (mostRight.right == root) {
+                res.push(val);
+                mostRight.right = null;
+                root = right;
+            } else {
+                mostRight.right = root;
+                root = left;
+            }
+        }
+    }
+    return res;
+}
+```
+
+### **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 {
+    fn dfs (root: &Option<Rc<RefCell<TreeNode>>>, res: &mut Vec<i32>) {
+        if root.is_none() {
+            return;
+        }
+        let node = root.as_ref().unwrap().borrow();
+        Self::dfs(&node.left, res);
+        res.push(node.val);
+        Self::dfs(&node.right, res);
+    }
+
+    pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        let mut res = vec![];
+        Self::dfs(&root, &mut res);
+        res
+    }
+}
+```
+
+迭代：
+
+```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 {
+    pub fn inorder_traversal(mut root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        let mut res = vec![];
+        let mut stack = vec![];
+        while root.is_some() || !stack.is_empty() {
+            if root.is_some() {
+                let next = root.as_mut().unwrap().borrow_mut().left.take();
+                stack.push(root);
+                root = next;
+            } else {
+                let mut node = stack.pop().unwrap();
+                let mut node = node.as_mut().unwrap().borrow_mut();
+                res.push(node.val);
+                root = node.right.take();
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```