94. Binary Tree Inorder Traversal #Medium

leetcode 94. Binary Tree Inorder Traversal #Medium

题意：输出给定二叉树的中序遍历序列

分析：按左、根、右的方式递归遍历每个节点，但是为了提高效率，用循环来实现，代码如下：

/**
 * 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
   
   
    
     inorderTraversal(TreeNode* root) {
        vector
    
    
     
      r;
        stack
     
     
      
       s;
        for(auto p=root;p || !s.empty();){
            for(;p;p=p->left)s.push(p);
            p=s.top();
            r.push_back(p->val);
            s.pop();
            p=p->right;
        }
        return r;
    }
};