94. Binary Tree Inorder Traversal
Description
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?
Analysis & Code
方法一:递归
方法二:非递归(栈)
/**
* 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> ret;
stack<TreeNode*> s;
TreeNode* p = root;
while(p || !s.empty()){
while(p){
s.push(p);
p = p->left;
}
p = s.top();
s.pop();
ret.push_back(p->val);
p = p->right;
}
return ret;
}
};
方法三:Threaded Binary Tree 线索二叉树
每次将当前节点cur移到其左子树最右节点的右子节点,然后cur指向原先的左子节点cur->left即新树的根节点,并将cur->left设为空以防止进入死循环。
/**
* 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> ret;
TreeNode* cur = root;
while(cur){
if(!cur->left){
ret.push_back(cur->val);
cur = cur->right;
}
else{
TreeNode* t = cur->left;
while(t->right){
t = t->right;
}
t->right = cur;
TreeNode* p = cur;
cur = cur->left; //新树的根节点
p->left = NULL; //去除多余关系,防止无限循环
}
}
return ret;
}
};