diff --git a/BFS_GRAPH_using_adjacency_list__queue.cpp b/BFS_GRAPH_using_adjacency_list__queue.cpp
index 5a8af81..633ba75 100644
--- a/BFS_GRAPH_using_adjacency_list__queue.cpp
+++ b/BFS_GRAPH_using_adjacency_list__queue.cpp
@@ -1,4 +1,5 @@
 //BFS of a graph complexity o(V+E) 
+//Algorithms
 #include<bits/stdc++.h>
 using namespace std;
 //Adjacency list and visited list
diff --git a/Binary_Tree b/Binary_Tree
index 7c33453..8f3ac03 100644
--- a/Binary_Tree
+++ b/Binary_Tree
@@ -1,4 +1,5 @@
 A binary tree is a structure comprising nodes, where each node has the following 3 components:
+Algo
 
     Data element: Stores any kind of data in the node
     Left pointer: Points to the tree on the left side of node
diff --git a/Tree_Traversal_levelorder.cpp b/Tree_Traversal_levelorder.cpp
index b1d3418..d80f3ff 100644
--- a/Tree_Traversal_levelorder.cpp
+++ b/Tree_Traversal_levelorder.cpp
@@ -2,6 +2,7 @@
 Time complexity : o(n)
 Space complexity : Best -> o(1) & Worst -> o(n)
 */
+//Algo
 #include<bits/stdc++.h>
 using namespace std;
 struct Node{