二叉树的中序遍历

最新推荐文章于 2024-01-13 16:03:18 发布

Xing_He1

最新推荐文章于 2024-01-13 16:03:18 发布

阅读量157

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Xing_He1/article/details/83218066

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

示例:

输入: [null,1,3,2,null]
   1
    \
     2
    /
   3

输出: [1,3,2]

https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/
递归访问

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */

int TreeNodeSize(struct TreeNode* root)
{
    if(NULL == root)
        return 0;
    return 1 + TreeNodeSize(root->left) + TreeNodeSize(root->right);
}

void _inorderTraversal(struct TreeNode *root,int *array,int *pIndex)
{
    if(NULL == root)
        return ;
    _inorderTraversal(root->left,array,pIndex);
    array[*pIndex]=root->val;
    (*pIndex)++;
    _inorderTraversal(root->right,array,pIndex);
}

int* inorderTraversal(struct TreeNode* root, int* returnSize) {
    *returnSize = TreeNodeSize(root);
    int *array = (int *)malloc(*returnSize * sizeof(*returnSize));
    int index = 0;
    _inorderTraversal(root,array,&index);
    return array;
}