LeetCode OJ:Binary Tree Inorder Traversal

Binary Tree Inorder Traversal

  b

Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [1,3,2].

Note: Recursive solution is trivial, could you do it iteratively?

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

算法思想：

题目要求要用迭代实现，用栈来存储要访问的节点，每次找到最左边的节点开始访问，如果该节点有右子树，则下次访问的是右子树中最左边的节点

/**
 * Definition for binary tree
 * 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> result;
        stack<TreeNode *> st;
        TreeNode *p=root;
        while(p){
            st.push(p);
            p=p->left;
        }
        while(!st.empty()){
            TreeNode *cur=st.top();st.pop();
            result.push_back(cur->val);
            if(cur->right){
                p=cur->right;
                while(p){
                    st.push(p);
                    p=p->left;
                }
            }
        }
        return result;
    }
};

简洁版

/**
 * Definition for binary tree
 * 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> result;
        TreeNode *p=root;
        stack<TreeNode *> stk;
        
        while(!stk.empty()||p){
            if(p){
                stk.push(p);
                p=p->left;
            }else{
                p=stk.top();
                stk.pop();
                result.push_back(p->val);
                p=p->right;
            }
        }
        return result;
    }
};

Morris中序遍历

/**
 * Definition for binary tree
 * 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> result;  
        TreeNode *cur,*prev;  
          
        cur=root;  
        while(cur){  
            if(cur->left==NULL){  
                result.push_back(cur->val);  
                prev=cur;  
                cur=cur->right;  
            }else{  
                TreeNode *left=cur->left;  
                while(left->right&&left->right!=cur)  
                    left=left->right;  
                      
                if(left->right==NULL){//建立线索  
                    left->right=cur;  
                    //prev=cur;  
                    cur=cur->left;  
                }else{//已经线索化，删除线索  
                    result.push_back(cur->val);  
                    left->right=NULL;  
                    prev=cur;  
                    cur=cur->right;  
                }  
            }  
        }  
        return result;  
    }
};