Leetcode-94. 二叉树的中序遍历

/**
 * 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 {
    vector<int> mNum;
public:
    vector<int> inorderTraversal(TreeNode* root) {
        init();
        mDfs(root);
        return mNum;
    }
    void mDfs(TreeNode* root)
    {
        if (root!= NULL)
        {
            mDfs(root->left);  //递归左子树
            mNum.push_back(root->val);
            mDfs(root->right);  //递归右子树
        }
    }
    void init()
    {
        mNum.clear();
    }
};