Number of Nodes in the binary tree.

Below is the source code of checking the number of Nodes in the binary tree.

If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com.

Thankyou.


#include <stdio.h>
#include <stdlib.h>
struct tree
{
    int data;
    struct tree *left;
    struct tree *right;
};
struct tree *Createnode(int data)
{
    struct tree *nd = (struct tree *)malloc(sizeof(struct tree));
    nd->left = NULL;
    nd->right = NULL;
    nd->data = data;
    return nd;
}
void preOrderTraversal(struct tree *root)
{
    if (root != NULL)
    {
        printf("%d ", root->data);
        preOrderTraversal(root->left);
        preOrderTraversal(root->right);
    }
}
void postOrderTraversal(struct tree *root)
{
    if (root != NULL)
    {
        postOrderTraversal(root->left);
        postOrderTraversal(root->right);
        printf("%d ", root->data);
    }
}
void inOrderTraversal(struct tree *root)
{
    if (root != NULL)
    {
        inOrderTraversal(root->left);
        printf("%d ", root->data);
        inOrderTraversal(root->right);
    }
}
int noOfNodes(struct tree *root)
{
    if (root == NULL)
        return 0;
    else
        return 1 + noOfNodes(root->left) + noOfNodes(root->right);
}

int main()
{
    struct tree *t = Createnode(4);
    struct tree *t1 = Createnode(1);
    struct tree *t2 = Createnode(6);
    struct tree *t4 = Createnode(5);
    struct tree *t5 = Createnode(2);
    struct tree *t6 = Createnode(8);
    struct tree *t7 = Createnode(9);
    t->left = t1;
    t->right = t2;
    t1->left = t4;
    t1->right = t6;
    t2->right = t5;
    t2->left = t7;
    // printf("Preorder traversal of the tree: \n");
    // preOrderTraversal(t);
    // printf("\n");
    // printf("Postorder traversal of the tree: \n");
    // postOrderTraversal(t);
    // printf("\n");
    // printf("Inorder traversal of the tree: \n");
    inOrderTraversal(t);
    // int k = noOfNodes(t);
    printf("\nNumber of nodes in the binary tree is : %d", noOfNodes(t));

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Height of the Tree.

  Below is the source code of checking the height of the binary tree. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   != ...
Read more

Insert and delete item in a BST

  #include   <stdio.h> #include   <stdlib.h> struct   tree {      int   data ;      struct   tree   * left ;      struct   tree   * right ; }; int   arr [ 9 ],  i   =   0 ; struct   tree   * Createnode ( int   data ) {      struct   tree   * nd   =  ( struct   tree   * ) malloc ( sizeof ( struct   tree ));      nd -> left   =   NULL ;      nd -> right   =   NULL ;      nd -> data   =   data ;      return   nd ; } void   inOrderTraversal ( struct   tree   * root ) {      if  ( root   !=   NULL )     {          inOrderTraversal ( root -> left );  ...
Read more

Multiple parenthesis balancing problem using stacks

  Below is the source code of parenthesis balancing problem using stacks. If you need any explanation then please feel free to contact me on my email i.e harshprasadaju@gmail.com. Thankyou. #include   <stdio.h> //Ignore spellings error #include   <stdlib.h> #include   <string.h> struct   stack {      int   top ;      int   size ;      char   * arr ; }; int   isEmpty ( struct   stack   * ptr ) {      if  ( ptr -> top   ==   - 1 )          return   1 ;      return   0 ; } struct   stack   * createStack ( int   size ) {      struct   stack   * s   =  ( struct   stack   * ) malloc ( sizeof ( struct   stack ));      s -> size   =   size ;   ...
Read more