Advertisement
Guest User

Untitled

a guest
Oct 20th, 2014
227
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. 2
  2. |
  3. 1 3
  4.  
  5. 2
  6. |
  7. 1
  8. |
  9. 3
  10.  
  11.  
  12. int main(void){
  13. struct node* root = NULL;
  14. struct node* n1;
  15. struct node* n2;
  16. root = insert(root, 2);
  17. n1 = insert(root, 1);
  18. n2 = insert(root, 3);
  19. print(root);
  20. return SUCCESS;
  21. }
  22.  
  23.  
  24.  
  25. int main(void){
  26. struct node* root = NULL;
  27. struct node* n1;
  28. struct node* n2;
  29. root = insert(root, 2);
  30. root = insert(root, 1);
  31. root = insert(root, 3);
  32. print(root);
  33. return SUCCESS;
  34. }
  35.  
  36. struct node* insert(struct node* node, int data){
  37. if(node == NULL){return newnode(data);}
  38. else{
  39. if(data < node->data){node->left = insert(node->left, data);}
  40. else{node->right = insert(node->right, data);}
  41. return node;
  42. }
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement