二叉数的先序，中序，后序遍历

最新推荐文章于 2024-07-18 08:26:33 发布

Champion163

最新推荐文章于 2024-07-18 08:26:33 发布

阅读量502

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_62512094/article/details/131075804

版权

/**

先序递归遍历

* 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;

}

};

中序递归遍历

/**

* 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;

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;

}

};

后序递归遍历

/**

* 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;

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;

}

};