当前位置：网站首页>Preorder traversal of binary tree

Preorder traversal of binary tree

2022-07-19 06:26:00 【Patrick star`】

144. Preorder traversal of two tree - Power button （LeetCode）

subject ：

Give you the root node of the binary tree root , Of its node value Before the order Traverse .

Ideas ：

If you have a hand

Code ：

void _preorderTraversal(struct TreeNode* root,int* arr,int* pi)
{
    if(root == NULL)
    {
        return;
    }
    arr[(*pi)++] = root->val;
    _preorderTraversal(root->left,arr,pi);
    _preorderTraversal(root->right,arr,pi);
    
}
int* preorderTraversal(struct TreeNode* root, int* returnSize)
{
    int* arr = (int*)malloc(sizeof(int)*100);
    int len = 0;
    _preorderTraversal(root,arr,&len);
    *returnSize = len;

    return arr; 
}

原网站

版权声明
本文为[Patrick star`]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207170509308199.html