weitere Beispielprogramme 3.5.2018

20180503/2-3-4-tree-7.cpp

+#include <iostream>
+
+using namespace std;
+
+const int MaxLeaves = 4;
+const int MaxEntries = MaxLeaves - 1;
+
+template <typename TElement>
+class TTree
+{
+
+  struct TEntry
+  {
+    TElement Content;
+    bool empty;
+
+    TEntry ()
+    {
+      empty = true;
+    }
+  };
+
+  struct TLeaf
+  {
+    TEntry Entry[MaxEntries];
+    TLeaf *Leaf[MaxLeaves];
+
+    TLeaf ()
+    {
+      for (int i = 0; i < MaxLeaves; i++)
+        Leaf[i] = NULL;
+    }
+
+    void SetEntry (int i, TElement e)
+    {
+      Entry[i].Content = e;
+      Entry[i].empty = false;
+    }
+  };
+
+  TLeaf *Root;
+
+private:
+
+  void SplitLeaf (TLeaf *FullLeaf, TElement NewElement, TLeaf *&Left, TLeaf *&Right, TEntry &Middle)
+  {
+    int m = MaxEntries / 2 + 1;
+  }
+
+public:
+
+  TTree ()
+  {
+    Root = NULL;
+  }
+
+  void Insert (TElement e)
+  {
+    if (!Root)
+      Root = new TLeaf ();
+    int i = 0;
+    while (i < MaxEntries && !Root->Entry[i].empty && e > Root->Entry[i].Content)
+      i++;
+    if (i < MaxEntries)
+      {
+        if (!Root->Entry[i].empty)
+          for (int j = MaxEntries - 1; j > i; j--)
+            Root->Entry[j] = Root->Entry[j - 1];
+        Root->SetEntry (i, e);
+      }
+  }
+
+  void Print ()
+  {
+    for (int i = 0; i < MaxEntries; i++)
+      cout << Root->Entry[i].Content << " ";
+    cout << endl;
+  }
+
+};
+
+int main ()
+{
+  TTree <int> t;
+  t.Insert (42);
+  t.Insert (13);
+  t.Insert (137);
+  t.Insert (7);
+  t.Print ();
+  return 0;
+}

20180503/2-3-4-tree-8.cpp

+#include <iostream>
+
+using namespace std;
+
+const int MaxLeaves = 4;
+const int MaxEntries = MaxLeaves - 1;
+
+template <typename TElement>
+class TTree
+{
+
+  struct TEntry
+  {
+    TElement Content;
+    bool empty;
+
+    TEntry ()
+    {
+      empty = true;
+    }
+  };
+
+  struct TLeaf
+  {
+    TEntry Entry[MaxEntries];
+    TLeaf *Leaf[MaxLeaves];
+
+    TLeaf ()
+    {
+      for (int i = 0; i < MaxLeaves; i++)
+        Leaf[i] = NULL;
+    }
+
+    void SetEntry (int i, TElement e)
+    {
+      Entry[i].Content = e;
+      Entry[i].empty = false;
+    }
+  };
+
+  TLeaf *Root;
+
+private:
+
+  void SplitLeaf (TLeaf *FullLeaf, TElement NewElement, TLeaf *&Left, TLeaf *&Right, TElement &Middle)
+  {
+    int i = 0;
+    while (i < MaxEntries && NewElement > FullLeaf->Entry[i].Content)
+      i++;
+    TElement Top;
+    if (i < MaxEntries)
+      {
+        Top = FullLeaf->Entry[MaxEntries - 1].Content;
+        for (int j = MaxEntries - 1; j > i; j--)
+          FullLeaf->Entry[j] = FullLeaf->Entry[j - 1];
+        FullLeaf->SetEntry (i, NewElement);
+      }
+    else
+      Top = NewElement;
+    // Achtung: Hier benutzen wir, daß MaxEntries = 3 ist!
+    Middle = FullLeaf->Entry[2].Content;
+    FullLeaf->Entry[2].empty = true;
+    Left = FullLeaf;
+    Right = new TLeaf ();
+    Right->SetEntry (0, Top);
+  }
+
+public:
+
+  TTree ()
+  {
+    Root = NULL;
+  }
+
+  void Insert (TElement e)
+  {
+    if (!Root)
+      Root = new TLeaf ();
+    if (Root->Entry[MaxEntries - 1].empty)
+      {
+        int i = 0;
+        while (i < MaxEntries && !Root->Entry[i].empty && e > Root->Entry[i].Content)
+          i++;
+        if (i < MaxEntries)
+          {
+            if (!Root->Entry[i].empty)
+              for (int j = MaxEntries - 1; j > i; j--)
+                Root->Entry[j] = Root->Entry[j - 1];
+            Root->SetEntry (i, e);
+          }
+      }
+    else
+      {
+        TLeaf *Left, *Right;
+        TElement Middle;
+        SplitLeaf (Root, e, Left, Right, Middle);  // "zerstört" Root
+        Root = new TLeaf ();
+        Root->SetEntry (0, Middle);
+        Root->Leaf[0] = Left;
+        Root->Leaf[1] = Right;
+      }
+  }
+
+  void Print ()
+  {
+    for (int i = 0; i < MaxEntries; i++)
+      if (!Root->Entry[i].empty)
+        cout << Root->Entry[i].Content << " ";
+    cout << endl;
+  }
+
+};
+
+int main ()
+{
+  TTree <int> t;
+  t.Insert (42);
+  t.Insert (13);
+  t.Insert (137);
+  t.Insert (7);
+  t.Print ();
+  return 0;
+}