LeetCode:Binary Tree Inorder Traversal

题目链接

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?

递归的方法这里就不多说，下面主要提供两个非递归算法：1、使用栈的非递归中序遍历；2、不使用栈的非递归中序遍历（Morris Traversal算法）

算法1：只要注意到每次要先遍历当前节点最左节点

/**
 * 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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<int> res;
        if(root == NULL)return res;
        stack<TreeNode*> mystack;
        TreeNode *p = root;
        while(p || mystack.empty() == false)
        {
            while(p)
            {
                mystack.push(p);
                p = p->left;
            }
            if(mystack.empty() == false)
            {
                p = mystack.top();
                res.push_back(p->val);
                mystack.pop();
                p = p->right;
            }
        }
        return res;
    }
};

算法2：关于Morris Traversal算法，他是基于线索二叉树，它利用二叉树节点中闲置的右指针指向该节点在中序序列中的后缀节点。可以参考here 和 here。该算法的空间复杂度为O(1)

文中给出算法步骤如下：

1. Initialize current as root 
2. While current is not NULL
   If current does not have left child
      a) Print current’s data
      b) Go to the right, i.e., current = current->right
   Else
      a) Make current as right child of the rightmost node in current's left subtree
      b) Go to this left child, i.e., current = current->left

总结一下就是：                                                                                                                                    本文地址

重复以下1、2直到当前节点为空。

1. 如果当前节点的左孩子为空，则输出当前节点并将其右孩子作为当前节点。

2. 如果当前节点的左孩子不为空，在当前节点的左子树中找到当前节点在中序遍历下的前驱节点（即当前节点的左子树的最右节点）。

   a) 如果前驱节点的右孩子为空，将它的右孩子设置为当前节点（利用这个空的右孩子指向它的后缀）。当前节点更新为当前节点的左孩子。

   b) 如果前驱节点的右孩子为当前节点，将它的右孩子重新设为空（恢复树的形状）。输出当前节点。当前节点更新为当前节点的右孩子。

/**
 * 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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
          TreeNode *current = NULL, *pre = NULL;
          vector<int> res;
          current = root;
          while(current != NULL)
          {                 
                if(current->left == NULL)
                {
                      res.push_back(current->val);
                      current = current->right;      
                }    
                else
                {
                      /* Find the inorder predecessor of current */
                      pre = current->left;
                      while(pre->right != NULL && pre->right != current)
                        pre = pre->right;
                        
                      if(pre->right == NULL)
                      {     /* Make current as right child of its inorder predecessor */
                            pre->right = current;
                            current = current->left;
                      }
                      else 
                      {
                            /* Revert the changes made in if part to restore the original 
                            tree i.e., fix the right child of predecssor */   
                            pre->right = NULL;
                            res.push_back(current->val);
                            current = current->right;      
                      } 
                }
          } 
          return res;
    }
};

【版权声明】转载请注明出处：http://www.cnblogs.com/TenosDoIt/p/3445449.html