FilesExpand file tree

 master

/

InOrderTraversal.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

37 lines (27 loc) · 883 Bytes

 master

/

InOrderTraversal.java

Top

File metadata and controls

• Code
• Blame

37 lines (27 loc) · 883 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

package Algorithms;

import java.util.ArrayList;

import java.util.Stack;

import Algorithms.tree.TreeNode;

public class InOrderTraversal {

public ArrayList<Integer> inorderTraversal(TreeNode root) {

ArrayList<Integer> rst = new ArrayList<Integer>();

TreeNode curr = root;

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

//s.push(curr);

while (true) {

// store the root and go to the far left.

while (curr != null) {

s.push(curr);

curr = curr.left;

}

if (s.isEmpty()) {

return rst;

}

curr = s.pop();

rst.add(curr.val);

// traversal the right branch.

curr = curr.right;

}

//return rst;

}

}