Guest User

Untitled

a guest
Jan 19th, 2019
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. 004FF97C
  2. 004FF97C
  3. 004FF894
  4. 004FF97C
  5. 004FF894
  6. 004FF7AC
  7. 004FF97C
  8. 004FF894
  9. 004FF7AC
  10. 004FF6C4
  11.  
  12. class NodeTree
  13. {
  14. public:
  15. int value;
  16. NodeTree *right;
  17. NodeTree *left;
  18.  
  19. NodeTree() {
  20. value = 0;
  21. }
  22. };
  23.  
  24. #include <iostream>
  25. using std::cout;
  26. using std::endl;
  27. #include "NodeTree.h"
  28.  
  29.  
  30. class BinaryTree
  31. {
  32. public:
  33. NodeTree * root;
  34. BinaryTree();
  35. void insert(int);
  36. void insertRight(NodeTree *, NodeTree **);
  37. };
  38.  
  39. #include "BinaryTree.h"
  40.  
  41. BinaryTree::BinaryTree() {
  42. root = NULL;
  43. }
  44.  
  45. void BinaryTree::insert(int num) {
  46.  
  47. NodeTree *node = new NodeTree;
  48. node->value = num;
  49. insertRight(node, &root);
  50. }
  51.  
  52. void BinaryTree::insertRight(NodeTree *node1, NodeTree **root1)
  53. {
  54. cout << &node1 << endl;
  55.  
  56. if (*root1 == NULL) {
  57. node1->left = NULL;
  58. node1->right = NULL;
  59. *root1 = node1;
  60. }
  61. else {
  62. insertRight(node1, &(*root1)->right);
  63. }
  64. }
  65.  
  66. #include "BinaryTree.h"
  67.  
  68. int main()
  69. {
  70. BinaryTree tree;
  71. tree.insert(5);
  72. tree.insert(10);
  73. tree.insert(15);
  74. tree.insert(20);
  75. tree.printInOrder(tree.root);
  76. return 0;
  77. }
Add Comment
Please, Sign In to add comment