Posted on 2014-01-18 02:44
Uriel 閱讀(122)
評論(0) 編輯 收藏 引用 所屬分類:
LeetCode
裸的中序遍歷二叉樹，想著用來練記事本直接寫代碼能力來著，結(jié)果CE一次，敲錯一個字母...囧
1 /**
2 * Definition for binary tree
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 public:
12 vector<int> res;
13
14 void inorder(TreeNode *root) {
15 if(root->left != NULL) inorder(root->left);
16 res.push_back(root->val);
17 if(root->right != NULL) inorder(root->right);
18 }
19
20 vector<int> inorderTraversal(TreeNode *root) {
21 res.clear();
22 if(root == NULL) return res;
23 inorder(root);
24 return res;
25 }
26 };