题目描述: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]
.
Note: Recursive solution is trivial, could you do it iteratively?
解题思路:采用左右根的形式后续遍历二叉树
Java代码实现:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
List<Integer> list=new ArrayList<Integer>();
public List<Integer> postorderTraversal(TreeNode root) {
if(root==null) return list;
if(root.left!=null) postorderTraversal(root.left);
if(root.right!=null) postorderTraversal(root.right);
list.add(root.val);
return list;
}
}
原题地址:
https://leetcode.com/problems/binary-tree-postorder-traversal/
版权声明:本文为博主原创文章,未经博主允许不得转载。