难度简单781收藏分享切换为英文接收动态反馈
给你一棵二叉树的根节点 root
,返回其节点值的 后序遍历 。
示例 1:
输入:root = [1,null,2,3] 输出:[3,2,1]
示例 2:
输入:root = [] 输出:[]
示例 3:
输入:root = [1] 输出:[1]
提示:
- 树中节点的数目在范围
[0, 100]
内 -100 <= Node.val <= 100
题目思路:递归,遇到一个节点就调用它的左节点和和有节点,直到找到它最底下的,然后进行压入数组
Python代码:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
ads = []
def dfs(root:TreeNode):
if root is None:
return
dfs(root.left)
dfs(root.right)
ads.append(root.val)
dfs(root)
return ads
C++代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
dfs(root , res);
return res;
}
void dfs(TreeNode* root , vector<int> &res){
if (root == nullptr){
return;
}
dfs(root->left , res);
dfs(root->right , res);
res.push_back(root->val);
}
};