二叉樹的創建，遍歷完整代碼

#include <stdio.h>
#include <stdlib.h>

typedef struct TreeNode{
    int value;
    struct TreeNode* Left;
    struct TreeNode* Right;
}TreeNode;

void printTree(TreeNode* T, int depth);

TreeNode *CreatTree()
{
    TreeNode * T = (TreeNode*)malloc(sizeof(TreeNode));
    int val;
    scanf_s("%d", &val);
    if (val == 0)
        return NULL;
    T->value = val;
    T->Left = T->Right = NULL;
    T->Left = CreatTree();
    T->Right = CreatTree();
    
    return T;
    
}

void InOrderTraversal(TreeNode* T, int depth)
{
    if (T)
    {
        InOrderTraversal(T->Left, depth + 1);
        printTree(T, depth);
        InOrderTraversal(T->Right, depth + 1);
    }
}

void printTree(TreeNode* T, int depth)
{
    while (depth--)
        printf("  ");
    printf("%d\n", T->value);
}

int main()
{
    TreeNode *T ;
    T = CreatTree();
    InOrderTraversal(T, 0);

    return 0;
}