[Leetcode] Binary Tree Postorder Traversal

 1 /**
 2  * Definition for binary tree
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public List<Integer> postorderTraversal(TreeNode root) {
12         List<Integer> result=new ArrayList<Integer>();
13         myPostorderTraversal(root,result);
14         return result;
15     }
16 
17     private void myPostorderTraversal(TreeNode root, List<Integer> result) {
18         // TODO Auto-generated method stub
19         if(root!=null){
20             myPostorderTraversal(root.left, result);
21             myPostorderTraversal(root.right, result);
22             result.add(root.val);
23         }
24     }
25 }