- 二叉树的中序遍历
给定一个二叉树的根节点 root ,返回它的中序遍历 。
示例 1:
输入:root = [1,null,2,3]
输出:[1,3,2]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
提示:
树中节点数目在范围 [0, 100] 内
-100 <= Node.val <= 100
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
void Inorder(struct TreeNode* root, int* res, int* returnSize){
//确定递归的终止条件
if(root == NULL)
return;
//递归遍历左子树
Inorder(root->left, res, returnSize);
//将当前结点的值存储到数组中
res[(*returnSize)++] = root->val;
//递归遍历右子树
Inorder(root->right, res, returnSize);
}
int* inorderTraversal(struct TreeNode* root, int* returnSize){
*returnSize = 0;//初始化数组长度为0
int *res=(int *)malloc(sizeof(int)*109);
//递归进行中序遍历
Inorder(root, res, returnSize);
return res;
}