Create: 0094-binary-tree-inorder-traversal.rs

Author: AkifhanIlgaz

rust/0094-binary-tree-inorder-traversal.rs

@@ -0,0 +1,20 @@
+use std::cell::RefCell;
+use std::rc::Rc;
+impl Solution {
+    pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        fn inorder(node: &Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
+            if let Some(v) = node {
+                let v = v.borrow();
+                inorder(&v.left, result);
+                result.push(v.val);
+                inorder(&v.right, result);
+            }
+        }
+
+        let mut result = vec![];
+        if let Some(v) = root {
+            inorder(&Some(v), &mut result);
+        }
+        result
+    }
+}