大神的世界

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

#define max(a, b)(a > b ? a : b)

typedef struct node{
    int value;
    struct node *leftChild;
    struct node *rightChild;
}Tree;

int leaveCount(Tree *root)
{
    if(!root) return 0;
    else{
        int lLeave = leaveCount(root->leftChild);
        int rLeave = leaveCount(root->rightChild);

        if( lLeave + rLeave > 0) return lLeave + rLeave; // Internal node  (propagation)
        else return 1; // leaf
    }
}

// just create a tree without any skill
void createTree(Tree *root)
{
    /*   1
       2    3
     4   5   6 */

    Tree *node[5];
    for(int i = 0; i<5; i++){
        node[i] = (Tree *)malloc(sizeof(Tree *));
        node[i]->value = i+2;
    }

    root->value = 1;
    root->leftChild = node[0];
    root->rightChild = node[1];
    node[0]->leftChild = node[2];
    node[0]->rightChild = node[3];
    node[1]->rightChild = node[4];
}

int main()
{
    Tree *Tree_A = (Tree *)malloc(sizeof(Tree));
    createTree(Tree_A);
    printf("leave# : %d\n", leaveCount(Tree_A));  
    return 0;
}