第十四天打卡
二叉树的前序遍历
class Solution {
public:
void traversal(TreeNode* cur, vector<int>& res)
{
if(cur==NULL) return;
res.push_back(cur->val);
traversal(cur->left,res);
traversal(cur->right,res);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
traversal(root,result);
return result;
}
};
二叉树的中序遍历
class Solution {
public:
void traversal(TreeNode *cur,vector<int>& res)
{
if(cur==NULL) return;
traversal(cur->left,res);
res.push_back(cur->val);
traversal(cur->right,res);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
traversal(root,res);
return res;
}
};
二叉树的后序遍历
class Solution {
public:
void traversal(TreeNode *cur,vector<int>& res)
{
if(cur==NULL) return;
traversal(cur->left,res);
traversal(cur->right,res);
res.push_back(cur->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
traversal(root,res);
return res;
}
};