diff --git a/Fibonacci heap b/Fibonacci heap
new file mode 100644
index 0000000..496c0b5
--- /dev/null
+++ b/Fibonacci heap	
@@ -0,0 +1,89 @@
+// C++ program to demonstrate building and inserting in a Fibonacci heap 
+// Time complexity of the program is O(1) 
+#include <cstdlib> 
+#include <iostream> 
+#include <malloc.h> 
+using namespace std; 
+  
+struct node { 
+    node* parent; 
+    node* child; 
+    node* left; 
+    node* right; 
+    int key; 
+}; 
+  
+// Creating min pointer as "mini" 
+struct node* mini = NULL; 
+  
+// Declare an integer for number of nodes in the heap 
+int no_of_nodes = 0; 
+  
+// Function to insert a node in heap 
+void insertion(int val) 
+{ 
+    struct node* new_node = (struct node*)malloc(sizeof(struct node)); 
+    new_node->key = val; 
+    new_node->parent = NULL; 
+    new_node->child = NULL; 
+    new_node->left = new_node; 
+    new_node->right = new_node; 
+    if (mini != NULL) { 
+        (mini->left)->right = new_node; 
+        new_node->right = mini; 
+        new_node->left = mini->left; 
+        mini->left = new_node; 
+        if (new_node->key < mini->key) 
+            mini = new_node; 
+    } 
+    else { 
+        mini = new_node; 
+    } 
+} 
+  
+// Function to display the heap 
+void display(struct node* mini) 
+{ 
+    node* ptr = mini; 
+    if (ptr == NULL) 
+        cout << "The Heap is Empty" << endl; 
+  
+    else { 
+        cout << "The root nodes of Heap are: " << endl; 
+        do { 
+            cout << ptr->key; 
+            ptr = ptr->right; 
+            if (ptr != mini) { 
+                cout << "-->"; 
+            } 
+        } while (ptr != mini && ptr->right != NULL); 
+        cout << endl 
+             << "The heap has " << no_of_nodes << " nodes" << endl; 
+    } 
+} 
+// Function to find min node in the heap 
+void find_min(struct node* mini) 
+{ 
+    cout << "min of heap is: " << mini->key << endl; 
+} 
+  
+  
+// Driver code 
+int main() 
+{ 
+  
+    no_of_nodes = 7; 
+    insertion(4); 
+    insertion(3); 
+    insertion(7); 
+    insertion(5); 
+    insertion(2); 
+    insertion(1); 
+    insertion(10); 
+  
+    display(mini); 
+  
+    find_min(mini); 
+  
+    return 0; 
+}