/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public List<Integer> postorderTraversal(TreeNode root) { List<Integer> result = new ArrayList<Integer>(); traversalHelper(result, root); return result; } public void traversalHelper(List<Integer> result, TreeNode root){ if(root == null){ return; } traversalHelper(result, root.left); traversalHelper(result, root.right); result.add(root.val); } }
Binary Tree Postorder Traversal
最新推荐文章于 2020-07-15 16:04:07 发布