94. 二叉树的中序遍历 

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution 
11 {
12     vector<int> res;
13 public:
14     vector<int> inorderTraversal(TreeNode* root) 
15     {
16         if(root == NULL) return res;
17         stack<TreeNode*> s;
18         TreeNode* head = root;
19         while(!s.empty() || head != NULL)
20         {
21             if(head != NULL) s.push(head),head = head->left;
22             else 
23             {
24                 head = s.top(),s.pop();
25                 res.push_back(head->val);
26                 head = head->right;
27             }
28         }
29         return res;
30     }
31 };

 

posted @ 2020-03-23 22:25  Jinxiaobo0509  阅读(123)  评论(0)    收藏  举报