一、前序遍历
1.递归实现
/**
* 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 {
private:
vector<int> pre_order;
public:
vector<int> preorderTraversal(TreeNode* root) {
if(root==nullptr){
pre_order.resize(0);
return pre_order;
}
pre_order.push_back(root->val);
if(root->left!=nullptr){
preorderTraversal(root->left);
}
if(root->right!=nullptr){
preorderTraversal(root->right);
}
return pre_order;
}
};
二、中序遍历
- 递归实现
/**
* 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 {
private:
vector<int> tree;
public:
vector<int> inorderTraversal(TreeNode* root) {
if(root==nullptr)
return tree;
if(root->left!=nullptr){
inorderTraversal(root->left);
}
tree.push_back(root->val);
if(root->right!=nullptr){
inorderTraversal(root->right);
}
return tree;
}
};
三、后序遍历
1.递归实现
/**
* 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 {
private:
vector<int> tree;
public:
vector<int> postorderTraversal(TreeNode* root) {
if(root==nullptr)
return tree;
if(root->left!=nullptr){
postorderTraversal(root->left);
}
if(root->right!=nullptr){
postorderTraversal(root->right);
}
tree.push_back(root->val);
return tree;
}
};
四、层次遍历