diff --git a/problems/0538.把二叉搜索树转换为累加树.md b/problems/0538.把二叉搜索树转换为累加树.md
index 9940e604..36dbfa70 100644
--- a/problems/0538.把二叉搜索树转换为累加树.md
+++ b/problems/0538.把二叉搜索树转换为累加树.md
@@ -371,6 +371,31 @@ object Solution {
 }
 ```
 
+## rust
+
+递归：
+
+```rust
+impl Solution {
+    pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
+        let mut pre = 0;
+        Self::traversal(&root, &mut pre);
+        root
+    }
+
+    pub fn traversal(cur: &Option<Rc<RefCell<TreeNode>>>, pre: &mut i32) {
+        if cur.is_none() {
+            return;
+        }
+        let mut node = cur.as_ref().unwrap().borrow_mut();
+        Self::traversal(&node.right, pre);
+        *pre += node.val;
+        node.val = *pre;
+        Self::traversal(&node.left, pre);
+    }
+}
+```
+
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">