coderaven
diff --git a/‎btree.c
Lines changed: 42 additions & 0 deletions b/‎btree.c
Lines changed: 42 additions & 0 deletions
diff --git a/‎btree.exe
229 Bytes b/‎btree.exe
229 Bytes
@@ -1,4 +1,13 @@
 #include <stdio.h>
+#define MAX 100
+
+// B-Tree Node Structure
+struct node {
+    int value[MAX];
+    struct node *keys[MAX+1];
+    struct node *parent;
+    int keyCount;
+} *tRoot = NULL;
 
 // Menu functions
 void showMenu();
@@ -7,6 +16,10 @@ void doDelete();
 void doSearch();
 void doInOrder();
 
+// Tree Operations
+struct node* newNode(int value,struct node *parent);
+struct node* insertN(int value,struct node *root,struct node *parent);
+
 
 int main(){
     showMenu();
@@ -15,6 +28,7 @@ int main(){
     return 0;
 }
 
+// Menus
 void showMenu(){
    system("cls"); 
    printf("      _____           _____              \n");
@@ -39,9 +53,16 @@ void showMenu(){
 }
 
 void doInsert(){
+     int value;
+     
      system("cls"); 
      printf("--- Insertion ---\n");
+     printf("Value: ");
+     scanf("%d",&value);
 
+     tRoot = insertN(value,tRoot,tRoot);
+     
+     printf("Press any key to continue...\n");
      getch();
      showMenu();
 }
@@ -50,6 +71,7 @@ void doDelete(){
      system("cls"); 
      printf("--- Deletion ---\n");
 
+     printf("Press any key to continue...\n");
      getch();
      showMenu();
 }
@@ -58,14 +80,34 @@ void doSearch(){
      system("cls"); 
      printf("--- Search ---\n");
 
+     printf("Press any key to continue...\n");
      getch();
      showMenu();
 }
 
 void doInOrder(){
      system("cls"); 
      printf("--- Printing ---\n");
+     printf("%d\n",tRoot->value[0]);
 
+     printf("Press any key to continue...\n");
      getch();
      showMenu();
 }
+
+// Operations
+struct node* newNode(int value,struct node *parent){
+       struct node *root = (struct node*)malloc(sizeof(struct node));
+       root->value[0] = value;
+       root->keyCount = 2;
+       root->parent = parent;
+       
+       return root;
+}
+
+struct node* insertN(int value,struct node *root,struct node *parent){
+       if (root == NULL){
+          return newNode(value,parent);
+       }
+}
+