2 files changed, 41 insertions, 0 deletions
diff --git a/increasing-order-search-tree/Cargo.toml b/increasing-order-search-tree/Cargo.toml
new file mode 100644
index 0000000..8dca9d6
--- /dev/null
+++ b/increasing-order-search-tree/Cargo.toml
@@ -0,0 +1,8 @@
+[package]
+name = "increasing-order-search-tree"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/increasing-order-search-tree/src/main.rs b/increasing-order-search-tree/src/main.rs
new file mode 100644
index 0000000..8953101
--- /dev/null
+++ b/increasing-order-search-tree/src/main.rs
@@ -0,0 +1,33 @@
+fn main() {
+    println!("Hello, world!");
+}
+
+struct Solution {}
+
+// 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 increasing_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        match root.unwrap().get_mut() {
+            TreeNode { val, left: None, right: None } => {root}
+        }
+    }
+}