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

Commit1a10732

Browse files
authored
Merge pull requestneetcode-gh#1614 from a93a/94
Create 94-Binary-Tree-Inorder-Traversal.kt
2 parentsaa99a49 +0d85d25 commit1a10732

File tree

1 file changed

+37
-0
lines changed

1 file changed

+37
-0
lines changed
Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
//iterative version
2+
classSolution {
3+
funinorderTraversal(root:TreeNode?):List<Int> {
4+
val res=ArrayList<Int>()
5+
val stack=Stack<TreeNode>()
6+
7+
var node= root
8+
while(node!=null||!stack.isEmpty()){
9+
while(node!=null){
10+
stack.push(node)
11+
node= node.left
12+
}
13+
node= stack.pop()
14+
res.add(node.`val`)
15+
node= node.right
16+
}
17+
18+
return res
19+
}
20+
}
21+
22+
//recursion version
23+
classSolution {
24+
funinorderTraversal(root:TreeNode?):List<Int> {
25+
val res=ArrayList<Int>()
26+
27+
funinOrder(node:TreeNode?) {
28+
node?:return
29+
inOrder(node.left)
30+
res.add(node.`val`)
31+
inOrder(node.right)
32+
}
33+
34+
inOrder(root)
35+
return res
36+
}
37+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp