[leetcode刷题系列]Binary Tree Inorder Traversal

我不知道我写的是不是啰嗦了- -不太清楚比较成熟的写法是怎样的。不过我觉得我写的这个扩展性应该是比较好的。

对于非二叉树，只需要多几个status就可以了。

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        vector<int> ret;
        stack<pair<TreeNode*, int> > stk;
        stk.push(make_pair(root, 0));
        while(!stk.empty()){
            pair<TreeNode*, int> now = stk.top();
            stk.pop();
            if(now.first == 0) // just like in dfs: if(root == 0) return ;
                continue;
            if(now.second == 1){
                // visit
                ret.push_back(now.first->val);
                stk.push(make_pair(now.first->right, 0));
            }else if(now.second == 0){
                stk.push(make_pair(now.first, 1));
                stk.push(make_pair(now.first->left, 0));
            }
        }
        return ret;
    }
};

====== 我是分割线=====

嗯，这两天学会了morris算法，所以实现了一下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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> ret;
        TreeNode * cur = root;
        while(cur != 0){
            if(cur->left == 0){
                ret.push_back(cur->val);
                cur = cur->right;
            }else{
                TreeNode * pre_node = cur->left;
                while(pre_node->right != 0 && pre_node->right != cur)
                    pre_node = pre_node->right;
                if(pre_node->right == 0){
                    pre_node->right = cur;
                    cur = cur->left;
                }else{
                    ret.push_back(cur->val);
                    pre_node->right = 0;
                    cur = cur->right;
                }
            }
        }
        return ret;
    }
};