题目描述:
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]
Follow up: Recursive solution is trivial, could you do it iteratively?
算法实现:
要求非递归实现中序遍历
使用堆栈,
- 从根节点开始访问节点,节点入栈;
- 如果节点有左子节点,则下一次访问其左节点,
- 如果节点没有左节点,读取当前节点的节点值,其后对栈进行操作,
- 访问栈顶,弹出栈顶,并访问栈顶的节点值,重复这一过程直到栈中弹出的节点有右子节点,
- 下一次访问该右子节点
/**
* 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) {
vector<int> res;
if(root == NULL)return res;
stack<TreeNode*> s;
TreeNode *T = root;
while(T != NULL){
s.push(T);
if(T -> left != NULL)
T = T -> left;
else{
T = s.top();
s.pop();
res.push_back(T -> val);
while(T -> right == NULL && !s.empty()){
T = s.top();
s.pop();
res.push_back(T -> val);
}
if(T -> right == NULL && s.empty())break;
T = T -> right;
}
// 这是前序遍历的方法,开始看错了
// res.push_back(T -> val);
// if(T -> right != NULL)
// s.push(T -> right);
// if(T -> left != NULL)
// T = T -> left;
// else if(!s.empty())
// {
// T = s.top();
// s.pop();
// }
// else
// break;
}
return res;
}
};