树的前序、中序、后序遍历
前序:根->左子树->右子树
中序:左子树->根->右子树
后序:左子树->右子树->根
145. Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes’ values.
For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [3,2,1].
后序遍历:先递归遍历左右子树,在push_back元素
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
if(root==NULL)
return rst;
POR(root);
return rst;
}
private:
vector<int> rst;
void POR(TreeNode* root){
if(root==NULL)
return;
POR(root->left);
POR(root->right);
rst.push_back(root->val);
}
};
Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.
For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,3,2].
中序遍历:遍历左子树,push_back,遍历右子树
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
if(root==NULL)
return rst;
LNR(root);
return rst;
}
private:
vector<int> rst;
void LNR(TreeNode* root){
if(root==NULL)
return;
LNR(root->left);
rst.push_back(root->val);
LNR(root->right);
}
};
Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes’ values.
For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [1,2,3].
前序遍历:先push_back,再遍历左子树,右子树
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
if(root==NULL)
return rst;
PRR(root);
return rst;
}
private:
vector<int> rst;
void PRR(TreeNode* root){
if(root==NULL)
return;
rst.push_back(root->val);
PRR(root->left);
PRR(root->right);
}
};