题解 | #二叉树的中序遍历#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param root TreeNode类 
 * @return int整型一维数组
 * @return int* returnSize 返回数组行数
 */
 typedef struct TreeNode BT;
 void Dfs(BT*root,int*ptmp,int*returnSize)
 {
    if(root==NULL)
    {
        return;
    }
    Dfs(root->left,ptmp,returnSize);
    ptmp[(*returnSize)++] = root->val;
     Dfs(root->right,ptmp,returnSize);
 }
int* inorderTraversal(struct TreeNode* root, int* returnSize ) {
    int*ptmp = (int*)malloc(sizeof(int)*1000);
    *returnSize = 0;//设置下标
    Dfs(root,ptmp,returnSize);
    return ptmp;
}