Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit53778be

Browse files
authored
Merge pull requestneetcode-gh#1971 from AkifhanIlgaz/0094
Create: 0094-binary-tree-inorder-traversal.rs
2 parentsd25bff8 +7e4c4c8 commit53778be

File tree

1 file changed

+20
-0
lines changed

1 file changed

+20
-0
lines changed
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
use std::cell::RefCell;
2+
use std::rc::Rc;
3+
implSolution{
4+
pubfninorder_traversal(root:Option<Rc<RefCell<TreeNode>>>) ->Vec<i32>{
5+
fninorder(node:&Option<Rc<RefCell<TreeNode>>>,result:&mutVec<i32>){
6+
ifletSome(v) = node{
7+
let v = v.borrow();
8+
inorder(&v.left, result);
9+
result.push(v.val);
10+
inorder(&v.right, result);
11+
}
12+
}
13+
14+
letmut result =vec![];
15+
ifletSome(v) = root{
16+
inorder(&Some(v),&mut result);
17+
}
18+
result
19+
}
20+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp