31--二叉树的中序遍历

给定一个二叉树的根节点 root ，返回它的中序遍历 。

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    //中序遍历
    void InOrder(TreeNode* bt, vector<int>& result)
    {
        if (bt != NULL)
        {
            InOrder(bt->left, result); 
            result.push_back(bt->val); 
            InOrder(bt->right, result); 
        }
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        InOrder(root, result);
        return result;
    }
};