145. Binary Tree Postorder Traversal
Posted Machelsky
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了145. 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 a binary tree node. * 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> res=new ArrayList<>(); if(root==null){ return res; } helper(res,root); return res; } public void helper(List<Integer> res,TreeNode root){ if(root==null){ return; } helper(res,root.left); helper(res,root.right); res.add(root.val); } }
以上是关于145. Binary Tree Postorder Traversal的主要内容,如果未能解决你的问题,请参考以下文章
leetcode 145. Binary Tree Postorder Traversal
145. Binary Tree Postorder Traversal
LeetCode145. Binary Tree Postorder Traversal 解题报告
145. Binary Tree Postorder Traversal