144. 二叉树的前序遍历
https://leetcode.cn/problems/binary-tree-preorder-traversal/
解题方法:
递归方法比较容易理解
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;
}
};
94. 二叉树的中序遍历
https://leetcode.cn/problems/binary-tree-inorder-traversal/
class Solution {
public:
void traversal(TreeNode* cur,vector<int> & vec)
{
if(cur == NULL) return;
traversal(cur->left,vec);
vec.push_back(cur->val);
traversal(cur->right,vec);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int>result;
traversal(root,result);
return result;
}
};
145. 二叉树的后序遍历
https://leetcode.cn/problems/binary-tree-postorder-traversal/
class Solution {
public:
void traversal(TreeNode* cur,vector<int> & vec)
{
if(cur == NULL) return;
traversal(cur->left,vec);
traversal(cur->right,vec);
vec.push_back(cur->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int>result;
traversal(root,result);
return result;
}
};