Kód: Vybrať všetko

#include <iostream>

using namespace std;

class Node {
private:
  Node *left;
  Node *right;
  int data;
};

class BTree {
private:
/*  struct Node {
    Node* left;
    Node* right;
    int data;
  };
*/
  Node* root;
public:
  BTree() {
    root = NULL;
  }
  void Print();
  void InOrder(Node*);
  void Insert(int data);
};

void BTree::Insert(int value) {
  Node* tmp = new Node;
  Node* rodic;
  tmp->data = value;
  tmp->left = NULL;
  tmp->right = NULL;
  rodic = NULL;

  if (root==NULL) {
    root = tmp;
  }
  else {
    Node* aktualny;
    aktualny = root;
    while(aktualny) {
      rodic = aktualny;
      if (tmp->data > aktualny->data) {
        aktualny = aktualny->right;
      }
      else aktualny = aktualny->left;
    }

    if(tmp->data < rodic->data) {
      rodic->left = tmp;
    }
    else rodic->right = tmp;
  }
}

void BTree::InOrder(Node* tree)
{
    if(tree != NULL)
    {
        if(tree->left) InOrder(tree->left);
        cout<<" "<<tree->data<<" ";
        if(tree->right) InOrder(tree->right);
    }
    else return;
}

void BTree::Print()
{
  InOrder(root);
}

int main() {
  BTree Strom;
  Strom.Insert(5);
	Strom.Insert(3);
	Strom.Insert(7);
	Strom.Insert(2);
	Strom.Insert(8);
  Strom.Print();
  return 0;
}