Count Number of Leaf Nodes in c pgm

Implement Depth First Search Traversal using Post Order

#include 

#include 

#include 

struct btnode 

{

    int value;

    struct btnode *l;

    struct btnode *r;

};

typedef struct btnode bt;

bt *root;

bt *new, *list;

bt *create_node();

void display(bt *);

void construct_tree();

void dfs(bt *);

void main()

{

    construct_tree();

    display(root);

    printf("\n");

    printf("Depth first traversal\n ");

    dfs(root);

}

bt * create_node()

{

    new=(bt *)malloc(sizeof(bt));

    new->l = NULL;

    new->r = NULL;

}

void construct_tree()

{

    root = create_node();

    root->value = 50;

    root->l = create_node();

    root->l->value = 20;

    root->r = create_node();

    root->r->value = 30;

    root->l->l = create_node();

    root->l->l->value = 70;

    root->l->r = create_node();

    root->l->r->value = 80;

    root->l->r->r = create_node();

    root->l->r->r->value = 60;

    root->l->l->l = create_node();

    root->l->l->l->value = 10;

    root->l->l->r = create_node();

    root->l->l->r->value = 40;      

}

void display(bt * list)

{

    if (list == NULL)

    {

        return;

    }

    display(list->l);

    printf("->%d", list->value);

    display(list->r);

}

void dfs(bt * list)

{

    if (list == NULL)

    {

        return;

    }

    dfs(list->l);

    dfs(list->r);

    printf("->%d ", list->value);

}

Output

->10->70->40->20->80->60->50->30

Depth first traversal

->10->40->70->60->80->20->30->50

Count Number of Leaf Nodes in a Tree

#include 

#include 

#include 

struct btnode 

{

    int value;

    struct btnode * l;

    struct btnode * r;

};

typedef struct btnode bt;

bt *root;

bt *new, *list;

int count = 0;

bt * create_node();

void display(bt *);

void construct_tree();

void count_leaf(bt *);

void main()

{

    construct_tree();

    display(root);

    count_leaf(root);

    printf("\n leaf nodes are : %d",count);

}

bt * create_node()

{

    new = (bt *)malloc(sizeof(bt));

    new->l = NULL;

    new->r = NULL;

}

void construct_tree()

{

    root = create_node();

    root->value = 50;

    root->l = create_node();

    root->l->value = 20;

    root->r = create_node();

    root->r->value = 30;

    root->l->l = create_node();

    root->l->l->value = 70;

    root->l->r = create_node();

    root->l->r->value = 80;

    root->l->r->r = create_node();

    root->l->r->r->value = 60;

    root->l->l->l = create_node();

    root->l->l->l->value = 10;

    root->l->l->r = create_node();

    root->l->l->r->value = 40; 

}

void display(bt * list)

{

    if (list == NULL)

    {

        return;

    }

    display(list->l);

    printf("->%d", list->value);

    display(list->r);

}

void count_leaf(bt * list)

{

    if (list == NULL)

    {

        return;

    }

    if (list->l == NULL && list->r == NULL)

    {

        count++;

    }

    count_leaf(list->l);

    count_leaf(list->r);

}

Output

->10->70->40->20->80->60->50->30

 leaf nodes are : 4