From 9002bf7afbe0bb31a8fa07105899455768dd4c55 Mon Sep 17 00:00:00 2001
From: Tomasz Polgrabia <tomasz@polgrabia.me>
Date: Sun, 9 Feb 2025 01:40:55 +0100
Subject: [PATCH] Looks like removing top works.

---
 current/algorithms/heap_binomial.c | 95 ++++++++++++++++++++++++------
 1 file changed, 78 insertions(+), 17 deletions(-)

diff --git a/current/algorithms/heap_binomial.c b/current/algorithms/heap_binomial.c
index 77f813c..8310d7d 100644
--- a/current/algorithms/heap_binomial.c
+++ b/current/algorithms/heap_binomial.c
@@ -1,3 +1,4 @@
+#include <limits.h>
 #include <stdlib.h>
 #include <stdio.h>
 #include <string.h>
@@ -111,40 +112,99 @@ void dump_heap(list *q) {
   }
 }
 
-list* node_add(list *q, long key) {
-  list *c = NULL;
-  list *a = q;
-  node *b = node_create(key);
-  list *bl;
+list* node_union(list *q, node *b) {
+  list *bl,*a = q, *c;
 
   if (!q) {
-    a = (list*)malloc(sizeof(list));
-    a->node = b;
-    return a;
+    bl = (list*)malloc(sizeof(list));
+    bl->node = b;
+    return bl;
   }
 
+  int added = 0;
+  bl = a;
   while (a) {
     if (a->node->lvl > b->lvl) { // it a always will be bigger or equal
       list *el = (list*)malloc(sizeof(list));
       el->node = b;
       el->next = a;
       return el;
-    } else {
-      c = a->next;
+    } if (a->node->lvl == b->lvl) {
       a->node = node_union_same_lvl(a->node, b);
       bl = a;
       b = a->node;
-      a = c;
+      a = a->next;
+      added++;
+    } else {
+      bl = a;
+      a = a->next;
     }
   }
 
-  return bl;
+  if (!added) {
+    list *el = (list*)malloc(sizeof(list));
+    el->node = b;
+    el->next = NULL;
+    bl->next = el;
+    return q;
+  } else {
+    return bl;
+  }
 
 }
 
-int node_del(node *q) {
-  // TODO
-  return -1;
+list* node_add(list *q, long key) {
+  node *b = node_create(key);
+
+  return node_union(q, b);
+}
+
+int node_del(list **q) {
+  list *t = *q;
+  long maxValue = INT_MIN;
+  node *maxTree = NULL;
+  
+  while (t) {
+    if (!maxTree || t->node->key > maxValue) {
+      maxValue = t->node->key;
+      maxTree = t->node;
+    }
+
+    t = t->next;
+  }
+
+  // we have max element and tree now
+
+  t = *q;
+
+  if (t->node == maxTree) {
+    printf("Removed maxtree is the beginning\n");
+    t = t->next;
+  } else {
+    printf("Removed maxtree is not the beginning\n");
+    while (t && t->next && t->next->node != maxTree) {
+      t = t->next;
+    }
+
+    t->next = t->next->next;
+  }
+
+  printf("New list pointer 0x%x\n", t);
+
+  // we removed the maxTree from the list
+
+  node *c = maxTree->child;
+  node *b;
+  while (c) {
+    b = c->right;
+    c->right = NULL;
+    t = node_union(t, c);
+    c = b;
+  }
+
+  *q = t;
+  
+  return maxValue;
 }
 
 
@@ -175,8 +235,9 @@ int main() {
         fprintf(stderr, "There is nothing to delete - heap is empty\n");
         continue;
       }
-      // TODO: long key = node_del(q);
-      // printf("Removed element: %d\n", key);
+      
+      long key = node_del(&q);
+      printf("Removed element: %d\n", key);
     } else {
       // handle unknown command
       fprintf(stderr, "Got unknown command %s\n", cmd);