目录
二叉树的前序遍历:
递归:
class Solution {
public:
void traveral(TreeNode* cur,vector<int>& result)
{
if(cur==NULL)
{
return;
}
result.push_back(cur->val);//中
traveral(cur->left,result);//左
traveral(cur->right,result);//右
}
vector<int> preorderTraversal(TreeNode* root)
{
vector<int> result;
traveral(root,result);
return result;
}
};
迭代:
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root)
{
vector<int> result;//接收结果
stack<TreeNode*> s;
if(root==NULL) return result;
s.push(root);
while(!s.empty())
{
TreeNode* temp=s.top();
s.pop();
result.push_back(temp->val);
if(temp->right) s.push(temp->right);//右子树不为空入栈
if(temp->left) s.push(temp->left);//左子树不为空入栈
}
return result;
}
};
二叉树的中序遍历:
递归:
class Solution {
public:
void traversal(TreeNode* cur,vector<int>& result)
{
if(cur==NULL)
{
return;
}
traversal(cur->left,result);//左
result.push_back(cur->val);//中
traversal(cur->right,result);//右
}
vector<int> inorderTraversal(TreeNode* root)
{
vector<int> result;
traversal(root,result);
return result;
}
};
迭代:
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root)
{
vector<int> result;//接收结果
stack<TreeNode*> s;
TreeNode* cur=root;
while(cur!=NULL||!s.empty())
{
if(cur!=NULL)
{
s.push(cur);
cur=cur->left;
}
else
{
cur=s.top();
result.push_back(cur->val);
cur=cur->right;
s.pop();
}
}
return result;
}
};
二叉树的后序遍历:
递归:
class Solution {
public:
void traversal(TreeNode* cur,vector<int>& result)
{
if(cur==NULL)
{
return;
}
traversal(cur->left,result);//左
traversal(cur->right,result);//右
result.push_back(cur->val);//中
}
vector<int> postorderTraversal(TreeNode* root)
{
vector<int> result;
traversal(root,result);
return result;
}
};
迭代:
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root)
{
vector<int> result;//接收结果
stack<TreeNode*> s;
if(root==NULL) return result;
s.push(root);
while(!s.empty())
{
TreeNode* temp=s.top();
s.pop();
result.push_back(temp->val);
if(temp->left) s.push(temp->left);//左子树不为空入栈
if(temp->right) s.push(temp->right);//右子树不为空入栈
}
reverse(result.begin(),result.end());//翻转
return result;
}
};
二叉树的层次遍历:
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root)
{
vector<vector<int>> result;
queue<TreeNode*> que;
if(root==NULL)
{
return result;
}
que.push(root);
while(!que.empty())
{
int size=que.size();//记录此层元素大小
vector<int> v;
//控制一层一层的输出
for(int i=0;i<size;i++)
{
TreeNode* temp=que.front();
que.pop();
v.push_back(temp->val);
if(temp->left!=NULL) que.push(temp->left);
if(temp->right!=NULL) que.push(temp->right);
}
result.push_back(v);
}
return result;
}
};