给定一个二叉树,返回它的 后序 遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [3,2,1]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-postorder-traversal
1.递归
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution
{
List<Integer> res = new ArrayList<Integer>();
public List<Integer> postorderTraversal(TreeNode root)
{
postorder(root);
return res;
}
public void postorder(TreeNode root)
{
if(root==null)
return;
postorder(root.left);
postorder(root.right);
res.add(root.val);
}
}
2.栈
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution
{
List<Integer> res = new ArrayList<>();
public List<Integer> postorderTraversal(TreeNode root)
{
postorder(root);
return res;
}
public void postorder(TreeNode root)
{
if(root==null)
return ;
Stack<TreeNode> tStack = new Stack<>();
tStack.push(root);
while (!tStack.isEmpty())
{
TreeNode node = tStack.pop();
res.add(0,node.val);
if (node.left != null) tStack.push(node.left);
if (node.right != null) tStack.push(node.right);
}
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution
{
List<Integer> res = new ArrayList<>();
public List<Integer> postorderTraversal(TreeNode root)
{
postorder(root);
return res;
}
public void postorder(TreeNode root)
{
Stack<TreeNode> tStack = new Stack<>();
TreeNode node = null;
while (root!=null||!tStack.isEmpty())
{
if(root!=null) //左子树
{
tStack.push(root);
root = root.left;
}
else
{
root = tStack.peek(); //右子树
if(root.right!=null&&root.right!=node)
{
root = root.right;
tStack.push(root);
root = root.left;
}
else
{
root = tStack.pop();
res.add(root.val);
node = root;
root = null;
}
}
}
}
}
public void postorder(TreeNode root)
{
Stack<TreeNode> tStack = new Stack<>();
TreeNode node = null;
while (root!=null||!tStack.isEmpty())
{
if(root!=null)
{
tStack.push(root);
root = root.left;
}
else
{
root = tStack.pop();
if(root.right!=null&&root.right!=node)
{
tStack.push(root);
root = root.right;
}
else
{
res.add(root.val);
node = root;
root = null;
}
}
}
}