本文共 706 字，大约阅读时间需要 2 分钟。
Binary Tree Postorder Traversal
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].
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public List postorderTraversal(TreeNode root) { List list = new ArrayList (); TraUTL(root, list); return list; } public void TraUTL(TreeNode root, List list) { if(null == root) return; TraUTL(root.left, list); TraUTL(root.right, list); list.add(root.val); }} 转载地址：http://fiuni.baihongyu.com/