Advertisement
Guest User

Untitled

a guest
Nov 13th, 2019
131
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.81 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. struct Node * tree_add (struct Node * tree, Data x) {
  5.     if (tree == NULL) {
  6.         struct Node* newTree = (struct Node*)calloc(1, sizeof(struct Node));
  7.         newTree->left = NULL;
  8.         newTree->right = NULL;
  9.         newTree->val = x;
  10.         return newTree;
  11.     }
  12.     if (x < tree->val)
  13.         tree->left = tree_add(tree->left, x);
  14.     if (x > tree->val)
  15.         tree->right = tree_add(tree->right, x);
  16.     return tree;
  17. }
  18.  
  19. void tree_print (struct Node * tree) {
  20.     if (tree == NULL)
  21.         return;
  22.     tree_print(tree->left);
  23.     printf("%d ", tree->val);
  24.     tree_print(tree->right);
  25. }
  26.  
  27. void tree_destroy (struct Node * tree) {
  28.     if (tree == NULL)
  29.         return;
  30.     tree_destroy(tree->left);
  31.     tree_destroy(tree->right);
  32.     free(tree);
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement