FilesExpand file tree

 master

/

BinaryTreePostorderTraversal.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

62 lines (58 loc) · 1.12 KB

 master

/

BinaryTreePostorderTraversal.java

Copy path

Top

File metadata and controls

• Code
• Blame

62 lines (58 loc) · 1.12 KB

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

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

import java.util.ArrayList;

import java.util.Stack;

/**

* Given a binary tree, return the postorder traversal of its nodes' values.

*

* For example:

* Given binary tree {1,#,2,3},

* 1

* \

* 2

* /

* 3

* return [3,2,1].

*

* Note: Recursive solution is trivial, could you do it iteratively?

*

* Solution:

*

* 1. Root - Right - Left

* 2. Then reverse the sequence

* 3. Left - Right - Root

*

*/

public class BinaryTreePostorderTraversal {

public ArrayList<Integer> postorderTraversal(TreeNode root) {

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

if (root == null)

return ret;

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

TreeNode p = root.right;

ret.add(root.val);

st.add(root);

while (!st.isEmpty()) {

while (p != null) {

ret.add(p.val);

st.add(p);

p = p.right;

}

TreeNode node = st.pop();

p = node.left;

if (p != null) {

ret.add(p.val);

st.add(p);

p = p.right;

}

}

int i = 0;

int j = ret.size() - 1;

while(i < j) {

int tmp = ret.get(i);

ret.set(i, ret.get(j));

ret.set(j, tmp);

i++;

j--;

}

return ret;

}

}