145.二叉树的后序遍历
题目：二叉树的后序遍历 点击跳转
文章目录
- 题目描述
- 后序遍历
题目描述
后序遍历
/** * 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; * } * } */classSolution{List<Integer>res=newArrayList<>();publicList<Integer>postorderTraversal(TreeNoderoot){dfs(root);returnres;}publicvoiddfs(TreeNodenode){if(node==null){return;}dfs(node.left);dfs(node.right);res.add(node.val);}}