以二叉树的前中后序遍历为例(C++)。
题目链接:
前序:https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
中序:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
后序:https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
前序遍历:
根结点->左子树->右子树
class Solution {
private:
vector<int> result;
void preorder(TreeNode* root)
{
if(root==NULL)
{
return ;
}
result.push_back(root->val);
preorder(root->left);
preorder(root->right);
}
public:
vector<int> preorderTraversal(TreeNode* root) {
preorder(root);
return result;
}
};
中序遍历:
左子树->根结点->右子树
class Solution {
private:
vector<int> result;
void Inorder(TreeNode* root)
{
if(root==NULL)
{
return;
}
Inorder(root->left);
result.push_back(root->val);
Inorder(root->right);
}
public:
vector<int> inorderTraversal(TreeNode* root) {
Inorder(root);
return result;
}
};
后序遍历:
左子树->右子树->根结点
class Solution {
private:
vector<int> result;
void postorder(TreeNode* root){
if(root==NULL)
{
return ;
}
postorder(root->left);
postorder(root->right);
result.push_back(root->val);
}
public:
vector<int> postorderTraversal(TreeNode* root) {
postorder(root);
return result;
}
};