FilesExpand file tree

 main

/

0094-binary-tree-inorder-traversal.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (32 loc) · 931 Bytes

 main

/

0094-binary-tree-inorder-traversal.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (32 loc) · 931 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

class Solution {

public List<Integer> inorderTraversal(TreeNode root) {

//iterative

List<Integer> res = new ArrayList<>();

if(root == null) return res;

Stack<TreeNode> stack = new Stack<>();

TreeNode node = root;

while(!stack.isEmpty() || node != null) {

if(node != null) {

stack.push(node);

node = node.left;

} else {

node = stack.pop();

res.add(node.val);

node = node.right;

}

}

return res;

//recursive

// List<Integer> res = new ArrayList<>();

// dfs(root, res);

// return res;

}

// public void dfs(TreeNode n, List<Integer> res) {

// if(n == null) {

// return;

// }

// dfs(n.left, res);

// res.add(n.val);

// dfs(n.right, res);

// }

}