From fa82c05a706f4abd1029d7c39c666ee5ca0e937b Mon Sep 17 00:00:00 2001
From: Your Name <you@example.com>
Date: Sat, 21 Feb 2026 14:55:19 +0300
Subject: [PATCH] Added label and freeNode

---
 src/bst.c | 21 +++++++++++++++++++++
 src/bst.h |  2 ++
 2 files changed, 23 insertions(+)

diff --git a/src/bst.c b/src/bst.c
index 25827b5..1b737b4 100644
--- a/src/bst.c
+++ b/src/bst.c
@@ -29,3 +29,24 @@ Tree* newTree()
     tree->root = NULL;
     return tree;
 }
+
+int label(bstNode* node)
+{
+    if (node == NULL) {
+        return 0;
+    }
+
+    return node->data;
+}
+
+void freeNode(bstNode* node)
+{
+    if (node == NULL) {
+        return 0;
+    }
+
+    free(node->leftChild);
+    free(node->rightChild);
+    free(node);
+    return 0;
+}
\ No newline at end of file
diff --git a/src/bst.h b/src/bst.h
index 3cdc45c..47fbd5b 100644
--- a/src/bst.h
+++ b/src/bst.h
@@ -5,9 +5,11 @@ typedef struct Tree Tree;
 
 bstNode* newNode(int);
 Tree* newTree();
+void freeNode(bstNode*);
 void bstInsert(Tree*, int);
 bool bstContains(Tree*, int);
 void bstFree(Tree*);
+int label(bstNode*, Tree*);
 
 void bstInorder(Tree*);
 void bstPreorder(Tree*);