From 1ad200b828e57f4038181947a683f95c8679b0fb Mon Sep 17 00:00:00 2001
From: Moritz Hertel <hertelmo99100@th-nuernberg.de>
Date: Thu, 18 Dec 2025 11:03:20 +0100
Subject: [PATCH] =?UTF-8?q?stack=20funktion=20vervollst=C3=A4ndigt?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 bintree.c | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/bintree.c b/bintree.c
index ddc57bb..0ff1c53 100644
--- a/bintree.c
+++ b/bintree.c
@@ -65,7 +65,6 @@ StackNode* initTraversal(TreeNode* root) {
 void* nextTreeData(StackNode** stack) {
     if (*stack == NULL) {
         return NULL; // Traversierung beendet
-    }
 
     // Obersten Knoten holen
     TreeNode* node = (TreeNode*)top(*stack);
@@ -79,7 +78,7 @@ void* nextTreeData(StackNode** stack) {
     }
 
     return node->data;
-}
+}}
 
 // Releases all memory resources (including data copies).
 void clearTree(TreeNode *root)