Advertisement
Guest User

Untitled

a guest
Apr 22nd, 2019
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. struct Node
  6. {
  7. int data;
  8. struct Node *left;
  9. struct Node *right;
  10. };
  11.  
  12. struct Node* createNode(int val)
  13. {
  14. struct Node *tmp =
  15. (struct Node*)malloc(sizeof(struct Node));
  16. tmp->data = val;
  17. tmp->left = NULL;
  18. tmp->right = NULL;
  19. return tmp;
  20. }
  21.  
  22. // Height of tree.
  23. int height(struct Node *root)
  24. {
  25. if(root == NULL)
  26. return 0;
  27. return 1 +
  28. max(height(root->left),
  29. height(root->right));
  30. }
  31.  
  32. int main(int argc, char* argv[])
  33. {
  34. struct Node *root = createNode(10);
  35. root->left = createNode(4);
  36. root->right = createNode(8);
  37. root->left->left = createNode(50);
  38. root->left->right = createNode(24);
  39. root->left->left->right = createNode(18);
  40. root->right->left = createNode(5);
  41.  
  42. cout<<"Height of tree: "<<height(root)<<endl;
  43. return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement