C++ Blatt 12 A30.cc

#include <iostream>
#include <cstdlib>
#include <time.h>
using namespace std;

class Node {
  private:
    double value;
    Node* left;
    Node* right;
  public:
    Node(double x) {
      value = x;
      left = 0;
      right = 0;
    }
    friend ostream& operator<<(ostream& os, Node& node) {
      if (node.left)
        os << *node.left;
      os << node.value << " ";
      if (node.right)
        os << *node.right;
      return os;
    }
    double min() {
      return left ? left->min() : value;
    }
    void insert(double x) {
      if (x < value && left)
        left->insert(x);
      if (x > value && right)
        right->insert(x);
      if (x < value && !left)
        left = new Node(x);
      if (x > value && !right)
        right = new Node(x);
    }
};

int main() {
  srand ((unsigned int)time(0));
  Node tree(1.0);
  for (int i = 0; i < 10; i++) {
    double x = 2.0 * double(rand())/RAND_MAX;
    cout << "Einzufügen: " << x << endl;
    tree.insert(x);
  }
  cout << "Die minimale Zahl im Baum ist: " << tree.min() << endl;
  cout << "Alle Einträge sortiert: " << endl << "  " << tree << endl;
}