145. Binary Tree Postorder Traversal
2016-11-02 21:16
417 查看
public static List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
if(root == null) {
return list;
}else {
preorder(list, root);
return list;
}
}
public static void preorder(List<Integer> list, TreeNode root) {
if(root == null) {
return ;
}else {
preorder(list,root.left);
preorder(list, root.right);
list.add(root.val);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode：145_Binary Tree Postorder Traversal | 二叉树后序遍历 | Hard
- leetcode——145——Binary Tree Postorder Traversal
- [LeetCode145]Binary Tree Postorder Traversal
- leetcode 145 —— Binary Tree Postorder Traversal
- Leetcode #145 Binary Tree Postorder Traversal
- Binary Tree Postorder Traversal - LeetCode 145
- LeetCode题解-145-Binary Tree Postorder Traversal
- Leetcode 145 Binary Tree Postorder Traversal
- Leetcode#145 Binary Tree Postorder Traversal
- LeetCode 145：Binary Tree Postorder Traversal（后序遍历）
- [LeetCode]145 Binary Tree Postorder Traversal
- LeetCode No145 Binary Tree Postorder Traversal
- Leetcode145: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode 145 Binary Tree Postorder Traversal
- LeetCode 145 Binary Tree Postorder Traversal
- LeetCode: Binary Tree Postorder Traversal [145]
- leetcode || 145、Binary Tree Postorder Traversal
- 145. Binary Tree Postorder Traversal
- LC145 Binary Tree Postorder Traversal
- LeetCode 145: Binary Tree Postorder Traversal(二叉树的后序遍历，迭代法)