一、前序遍历
题目:
144. Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.
Example:
Input:[1,null,2,3]
1 \ 2 / 3 Output:[1,2,3]
解答:
/**
* 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> preorderTraversal(TreeNode* root) {
// //方法一:递归
// if(root == nullptr)
// return res;
// res.push_back(root->val);
// preorderTraversal(root->left);
// preorderTraversal(root->right);
// return res;
// }
// private:
// vector<int> res;
//方法2:递归改进版本 另外新建了一个递归函数
public:
// vector<int> preorderTraversal(TreeNode* root)
// {
// recurse(root);
// return res;
// }
// //递归函数的调用
// void recurse(TreeNode* root)
// {
// if(root == nullptr)
// return;
// res.push_back(root->val);
// recurse(root->left);
// recurse(root->right);
// return;
// }
// private:
// vector<int> res;
//方法3::迭代循环
//前序遍历 要先访问节点再入栈, 入栈顺序是反过来
public:
vector<int> preorderTraversal(TreeNode * root)
{
if(root == nullptr)
return res;
stack<TreeNode*> s;
s.push(root);
while(!s.empty())
{
//先访问
TreeNode * p = s.top();
res.push_back(p->val);
s.pop();
//再入栈,先右后左
if(p->right)
s.push(p->right);
if(p->left)
s.push(p->left);
}
return res;
}
private:
vector<int> res;
};
二、中序遍历
题目:
94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2]
解答:
/**
* 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> inorderTraversal(TreeNode* root) {
//方法一:递归法
// if(root == nullptr)
// return res;
// inorderTraversal(root->left);
// res.push_back(root->val);
// inorderTraversal(root->right);
// return res;
//方法二:迭代法 先入栈 再访问 节点
if(root == nullptr)
return res;
stack<TreeNode*> s;
TreeNode* p = root;
while(!s.empty() || p != nullptr)
{
if(p != nullptr)//p非空 则一直左子树到底
{
s.push(p);
p = p->left;
}
else //p空,此时访问s中栈顶元素,也就是空p的前驱节点,此节点赋值给p. 然后访问它,之后p = p->right 方便后续的入栈p右子树
{
p = s.top();
res.push_back(p->val);
s.pop();
p = p->right;
}
}
return res;
}
private:
vector<int> res;
};
三、后序遍历
题目:
145. Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values.
Example:
Input:[1,null,2,3]
1 \ 2 / 3 Output:[3,2,1]
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
//后续时候新定义一个数据结构,is_Right用来标志是否访问过
struct PostTreeNode
{
TreeNode* Node;
bool isRight;
PostTreeNode(TreeNode* _Node, bool _isRight) : Node(_Node), isRight(_isRight) { }
};
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
//方法一:递归法
// if(!root)
// return res;
// postorderTraversal(root->left);
// postorderTraversal(root->right);
// res.push_back(root->val);
// return res;
//方法二:迭代法
if(!root)
return res;
stack<PostTreeNode*> s;//用来存储PostTreeNode* 节点
TreeNode* p = root;
PostTreeNode* temp = nullptr;//用来存储临时的PostTreeNode*变量
while(p || !s.empty())
{
if(p)//只要p不为空,一直左到底
{
temp = new PostTreeNode(p, false);
s.push(temp);//只有此处入栈s
p = p ->left;
}
else//p为空
{
temp = s.top();//并不出栈,仅仅获取栈顶元素
if(!temp->isRight)//首次访问节点时候,设置is_Right为true , 但是不访问该点,将p的右子树赋值给p,准备下一次入栈用
{
temp->isRight = true;
p = temp->Node->right;
}
else
{
res.push_back(temp->Node->val);//第二次访问,保存遍历结果值,然后出栈
s.pop();
}
}
}
return res;
}
private:
vector<int> res;
};