C program to count the leaves of the binary tree.

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 [email protected]
* 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.

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 [email protected]
* 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 = '';
return c;
}


//comment: skip over comment and return a character
int comment()
{
int c;
while((c = getch()) != EOF)
if(c == '*')
if((c = getch()) == '/')
break;
else
ungetch(c);
return c;
}

//TREESTORE:STORE IN LIST[] POINTERS TO TREE NODES

void treestore(struct tnode *p)
{
if(p != NULL) {
treestore(p->left);
if(ntn < NDISTINCT)
list[ntn++] = p;
treestore(p->right);
}
}

//sortlist: sort list of pointers to tree nodes
void sortlist()
{
int gap, i,j;
struct tnode *temp;

for(gap = ntn/2;gap > 0;gap /= 2)
for(i = gap; i < ntn;i++)
for(j = i - gap;j >= 0;j -= gap) {
if((list[j]->count) >= (list[j+gap]->count))
break;
temp = list[j];
list[j] = list[j+gap];
list[j+gap] = temp;
}
}
Read more c programs
C Basic
C Strings
K and R C Programs Exercise

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-3

K and R C, Solution to Exercise 6-3:
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.
C Program to Write a cross-referencer program that prints a list of all words in a document, and, for each word, a list of the line numbers on which it occurs. Remove noise words like “the”, “and,” and so on. 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 [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* Original URL: http://www.c-program-example.com/2012/02/k-r-c-programs-exercise-6-3.html
* GitHub URL: https://github.com/snadahalli/cprograms/blob/master/knrc/knrc6_3.c
***********************************************************/

/** Write a cross-referencer program that prints a list of all words in a
* document, and, for each word, a list of the line numbers on which it
* occurs. Remove noise words like "the", "and," and so on.
**/

#include
#include
#include
#include

char *dupstr(char *s) {
char *p = NULL;
if(s != NULL){
p = malloc(strlen(s) + 1);
if(p) {
strcpy(p, s);
}
}
return p;
}

int i_strcmp(const char *s, const char *t) {
int diff = 0;
char cs = 0;
char ct = 0;

while(diff == 0 && *s != '' && *t != '') {
cs = tolower((unsigned char)*s);
ct = tolower((unsigned char)*t);
if(cs < ct) {
diff = -1;
}
else if(cs > ct) {
diff = 1;
}
++s;
++t;
}

if(diff == 0 && *s != *t) {
if(*s == '') {
diff = -1;
}
else {
diff = 1;
}
}

return diff;
}

struct linelist {
struct linelist *next;
int line;
};

struct wordtree {
char *word;
struct linelist *firstline;
struct wordtree *left;
struct wordtree *right;
};

void printlist(struct linelist *list) {
if(list != NULL) {
printlist(list->next);
printf("%6d ", list->line);
}
}

void printtree(struct wordtree *node) {
if(node != NULL) {
printtree(node->left);
printf("%18s ", node->word);
printlist(node->firstline);
printf("n");
printtree(node->right);
}
}

struct linelist *addlink(int line) {
struct linelist *new = malloc(sizeof *new);
if(new != NULL) {
new->line = line;
new->next = NULL;
}
return new;
}

void deletelist(struct linelist *listnode) {
if(listnode != NULL) {
deletelist(listnode->next);
free(listnode);
}
}

void deleteword(struct wordtree **node) {
struct wordtree *temp = NULL;
if(node != NULL) {
if(*node != '') {
if((*node)->right != NULL) {
temp = *node;
deleteword(&temp->right);
}
if((*node)->left != NULL) {
temp = *node;
deleteword(&temp->left);
}
if((*node)->word != NULL) {
free((*node)->word);
}
if((*node)->firstline != NULL) {
deletelist((*node)->firstline);
}
free(*node);
*node = NULL;
}
}
}

struct wordtree *addword(struct wordtree **node, char *word, int line) {
struct wordtree *wordloc = NULL;
struct linelist *newline = NULL;
struct wordtree *temp = NULL;
int diff = 0;

if(node != NULL && word != NULL) {
if(NULL == *node) {
node = malloc(sizeof **node);
if(NULL != *node) {
(*node)->left = NULL;
(*node)->right = NULL;
(*node)->word = dupstr(word);
if((*node)->word != NULL) {
(*node)->firstline = addlink(line);
if((*node)->firstline != NULL) {
wordloc = *node;
}
}
}
}
else {
diff = i_strcmp((*node)->word, word);
if(0 == diff) {

newline = addlink(line);
if(newline != NULL) {
wordloc = *node;
newline->next = (*node)->firstline;
(*node)->firstline = newline;
}
}
else if(0 < diff) {
temp = *node;
wordloc = addword(&temp->left, word, line);
}
else {
temp = *node;
wordloc = addword(&temp->right, word, line);
}
}
}

if(wordloc == NULL) {
deleteword(node);
}

return wordloc;
}


char *char_in_string(char *s, int c) {
char *p = NULL;

/* if there's no data, we'll stop */
if(s != NULL) {
if(c != '') {
while(*s != '' && *s != c) {
++s;
}
if(*s == c) {
p = s;
}
}
}
return p;
}

char *tokenise(char **s, char *delims) {
char *p = NULL;
char *q = NULL;

if(s != NULL && *s != '' && delims != NULL) {
/* pass over leading delimiters */
while(NULL != char_in_string(delims, **s)) {
++*s;
}
if(**s != '') {
q = *s + 1;
p = *s;
while(*q != '' && NULL == char_in_string(delims, *q)) {
++q;
}

*s = q + (*q != '');
*q = '';
}
}

return p;
}

int NoiseWord(char *s)
{
int found = 0;
int giveup = 0;

char *list[] = {
"a",
"an",
"and",
"be",
"but",
"by",
"he",
"I",
"is",
"it",
"off",
"on",
"she",
"so",
"the",
"they",
"you"
};

int top = sizeof list / sizeof list[0] - 1;
int bottom = 0;
int guess = top / 2;

int diff = 0;

if(s != NULL) {
while(!found && !giveup) {
diff = i_strcmp(list[guess], s);
if(0 == diff) {
found = 1;
}
else if(0 < diff) {
top = guess - 1;
}
else {
bottom = guess + 1;
}
if(top < bottom) {
giveup = 1;
}
else {
guess = (top + bottom) / 2;
}
}
}

return found;
}

char *GetLine(char *s, int n, FILE *fp) {
int c = 0;
int done = 0;
char *p = s;

while(!done && --n > 0 && (c = getc(fp)) != EOF) {
if((*p++ = c) == 'n') {
done = 1;
}
}

*p = '';
if(EOF == c && p == s) {
p = NULL;
}
else {
p = s;
}
return p;
}

#define MAXLINE 8192

int main(void) {
static char buffer[MAXLINE] = {0};
char *s = NULL;
char *word = NULL;
int line = 0;
int giveup = 0;
struct wordtree *tree = NULL;

char *delims = " tnrafv!"%^&*()_=+{}[]\|/,.<>:;#~?";

while(!giveup && GetLine(buffer, sizeof buffer, stdin) != NULL) {
++line;
s = buffer;
while(!giveup && (word = tokenise(&s, delims)) != NULL) {
if(!NoiseWord(word)) {
if(NULL == addword(&tree, word, line)) {
printf("Error adding data into memory. Giving up.n");
giveup = 1;
}
}
}
}

if(!giveup) {
printf("%18s Line Numbersn", "Word");
printtree(tree);
}

deleteword(&tree);
return 0;
}
Read more c programs
C Basic
C Strings
K and R C Programs Exercise

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

C Program to add two polynomials using structures.

C Program to add two polynomials using structures. Structure is a c composite data type, in which we can define all the data types under the same name or object. Size of the Structure is the size of all data types, plus any internal padding. the key word “struct” is used to declare the structure. A Polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. 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 [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
*
* Happy Coding
***********************************************************/

#include < stdio.h >
#include < conio.h >
#define MAX 20

struct addpolynomial {
int exp, coef;
};

void main() {
struct addpolynomial p1[MAX], p2[MAX], p3[MAX];
int max1, max2, max3;
clrscr();
printf("nEnter first addpolynomial : ");
max1 = read_addpolynomial(p1);
printf("nEnter second addpolynomial : ");
max2 = read_addpolynomial(p2);
max3 = add_addpolynomial(p1, p2, p3, max1, max2);
printf("nFirst addpolynomial is ");
print_addpolynomial(p1, max1);
printf("nSecond addpolynomial is ");
print_addpolynomial(p2, max2);
printf("n The resultant addpolynomial after addition is");
print_addpolynomial(p3, max3);
}

//function to read polynomial
int read_addpolynomial(struct addpolynomial p[]) {
int i, texp;
i = 0;
printf("nEnter exp ( use -1 to exit) : ");
scanf("%d", &texp);
while (texp != -1) {
p[i].exp = texp;
printf("nEnter coef : ");
scanf("%d", &p[i].coef);
i++;
printf("nEnter exp ( use -1 to exit) : ");
scanf("%d", &texp);
}
return (i);
}

//function to print polynomial
int print_addpolynomial(struct addpolynomial p[], intMAX1) {
int i;
for (i = 0; i < max1; i++)
printf("%+dX%d ", p[i].coef, p[i].exp);
return;
}

//function to ad polynomials
int add_addpolynomial( p1, p2, p3, max1, max2)
struct addpolynomial p1[], p2[], p3[];
intMAX1, max2;
{
int i,j,k;
i = j = k = 0;
while ( i <max1 && j <max2)
{
if( p1[i].exp > p2[j].exp)
{
p3[k] = p1[i];
k++;
i++;
}
else
if( p1[i].exp < p2[j].exp)
{
p3[k] = p2[j];
k++;
j++;
}
else
{
p3[k].exp = p1[i].exp;
p3[k].coef = p1[i].coef + p2[j].coef;
i++;
j++;
k++;
}
}
while( i <max1 )
{
p3[k] = p1[i];
k++;
i++;
}
while( j <max2 )
{
p3[k] = p2[j];
k++;
j++;
}
return(k);
}

Array In C

C Data Structures

Simple C Programs

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