144 二叉树的前序遍历
https://leetcode.cn/problems/binary-tree-preorder-traversal/
https://www.bilibili.com/video/BV15f4y1W7i2/?spm_id_from=pageDriver&vd_source=dcd5888def27a31f413605366083456f
给你二叉树的根节点 root
,返回它节点值的 前序 遍历。
示例 1:
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-PaHnGXav-1670735039773)(%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E5%AD%A6%E4%B9%A0.assets/inorder_1.jpg)]
输入:root = [1,null,2,3]
输出:[1,2,3]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
示例 4:
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-sqj84u7h-1670735039775)(%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E5%AD%A6%E4%B9%A0.assets/inorder_5.jpg)]
输入:root = [1,2]
输出:[1,2]
示例 5:
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-oJjZJaLu-1670735039776)(%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E5%AD%A6%E4%B9%A0.assets/inorder_4.jpg)]
输入:root = [1,null,2]
输出:[1,2]
二叉树遍历:
确定递归函数参数与返回值
确定终止条件
确定单层递归逻辑
/**
* 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:
void traversal(TreeNode * cur, vector<int> & vec){
if(cur == NULL){
return;
}
vec.push_back(cur->val);
traversal(cur->left,vec);
traversal(cur->right,vec);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
traversal(root,result);
return result;
}
};