Guest User

Untitled

a guest
Jan 19th, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 1.03 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. #include<string.h>
  4.  
  5. typedef struct numtree {
  6.     int val;
  7.     struct numtree *left;
  8.     struct numtree *right;
  9. } numtree_t;
  10.  
  11. numtree_t *root, *node;
  12.  
  13. void makeTree(numtree_t *node1) {
  14.     if(root==NULL)
  15.     {
  16.         root = node;
  17.         root->left = NULL;
  18.         root->right = NULL;
  19.     }
  20.     else if(node->val <= root->val) makeTree(node->left);
  21.     else if(node->val > root->val) makeTree(node->right);
  22. }
  23.  
  24. void printTree(numtree_t *node1) {
  25.     if(node1!=NULL)
  26.     {
  27.         printf("%d\n", node1->val);
  28.         printTree(node1->left);
  29.         printTree(node1->right);
  30.     }
  31. }
  32.  
  33. int main() {
  34.     int num, i;
  35.     root = NULL;
  36.  
  37.     printf("Enter number of inputs: ");
  38.     scanf("%d", &num); getchar;
  39.  
  40.     for(i=1; i<=num; i++)
  41.     {
  42.         node = (numtree_t*) malloc(sizeof(numtree_t));
  43.  
  44.         printf("Input number: ");
  45.         scanf("%d", &node->val); getchar;
  46.         makeTree(node);
  47.     }
  48.  
  49.     numtree_t *node1 = root;
  50.     printTree(node1);
  51.     return 0;
  52. }
Add Comment
Please, Sign In to add comment