struct in c

C program to count the leaves of the binary tree.

Posted on by Sandeepa Nadahalli
Write a C program to count the leaves of the binary tree.
Binary tree is the ordered directed tree data structure, in which each node has at most two nodes.
A node is called as a leaf node,  if it does not contains any child elements. In this program, We used the structures to create the binary tree.
Read more about C Programming Language .
/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact info@c-program-example.com
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

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

struct node
{
 int data;
 struct node* leftnode;
 struct node* rightnode;
};

//get the leaves count
unsigned int getLeafCount(struct node* node)
{
 if(node == NULL)
  return 0;
 if(node->leftnode == NULL && node->rightnode==NULL)
  return 1;
 else
  return getLeafCount(node->leftnode)+
    getLeafCount(node->rightnode);
}


struct node* newNode(int data)
{
 struct node* node = (struct node*)
  malloc(sizeof(struct node));
 node->data = data;
 node->leftnode = NULL;
 node->rightnode = NULL;

 return(node);
}


int main()
{

 clrcsr();
 struct node *root = newNode(1);
 root->leftnode = newNode(2);
 root->rightnode = newNode(3);
 root->leftnode->leftnode = newNode(4);
 root->leftnode->rightnode = newNode(5); 


 printf("nnLeaf count of the binary tree is %d", getLeafCount(root));

 getch();
 return 0;
}


Read more Similar C Programs
Data Structures
Breadth First Search(BFS)
Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

K & R C Programs Exercise 6-4.

Posted on by Sandeepa Nadahalli
K and R C, Solution to Exercise 6-4:
K and R C Programs Exercises provides the solution to all the exercises in the C Programming Language (2nd Edition). You can learn and solve K&R C Programs Exercise.
Write a C Program that prints the distinct words in its input sorted into decreasing order of frequency of occurrence. Precede each word by its count. Read more about C Programming Language .
/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact info@c-program-example.com
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/


#include<stdio.h>
#include<ctype.h>

#define MAXWORD 100
#define NDISTINCT 1000

struct tnode(
  char *word;
int count;
struct tnode *addtree(struct tnode *, char *);
int getword(char *, int);
void sortlist(void);
void treestore(struct tnode *);
struct tnode *list[DISTINCT];
int ntn = 0;

/* print distinct words sorted in decreasing order of freq.*/
main()
{
 struct tnode *root;
 char word[MAXWORD]
           int i;

 root = NULL;
 while(getword(word, MAXWORD) != EOF)
  if(isalpha(word[0]))
   root = addtree(root, word);
 treestore(root);
 sortlist();
 for(i = 0;i < ntn; i++)
  printf("%2d:%20sn",list[i]->count,list[i]->word);
 return 0;
}

//getword: get next word or character from input
int getword(char *word, int lim)
{
 int c, d, comment(void), getch(void);
 void ungetch(int);
 char *w = word;
 while(isspace(c = getch()))
  ;
 if(c !=EOF)
  *w++ = c;
 if(isalpha(c) || c == '-' || c == '#'){
  for(; --lim > 0; w++)
   if(!isalnum(*w = getch()) && *w != '-') {
    ungetch(*w);
    break;
   }
 }
 else if(c == ''' || c == '\'){
  for( ; --lim > 0; w++)
   if(((*w = getch()) == '\')
     *++w = getch();
   else if(*w == c) {
    w++;
    break;
   }else if(*w == EOF)
    break;
 }else if(c == '/')
  if((d = getch()) == '*')
   c = comment();
  else
   ungetch(d);
 *w = '