From ca6266030e4c7673e8680bb56b9ae6a8622901eb Mon Sep 17 00:00:00 2001 From: abhishek23feb <72147347+abhishek23feb@users.noreply.github.com> Date: Fri, 2 Oct 2020 21:02:05 +0530 Subject: [PATCH 1/4] Update BFS_GRAPH_using_adjacency_list__queue.cpp --- BFS_GRAPH_using_adjacency_list__queue.cpp | 1 + 1 file changed, 1 insertion(+) diff --git a/BFS_GRAPH_using_adjacency_list__queue.cpp b/BFS_GRAPH_using_adjacency_list__queue.cpp index 5a8af81..212e351 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) +//Algorithm #include using namespace std; //Adjacency list and visited list From 69ba2054af45394ce29508b931ee77742fa51b44 Mon Sep 17 00:00:00 2001 From: abhishek23feb <72147347+abhishek23feb@users.noreply.github.com> Date: Fri, 2 Oct 2020 21:11:53 +0530 Subject: [PATCH 2/4] Update BFS_GRAPH_using_adjacency_list__queue.cpp --- BFS_GRAPH_using_adjacency_list__queue.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/BFS_GRAPH_using_adjacency_list__queue.cpp b/BFS_GRAPH_using_adjacency_list__queue.cpp index 212e351..633ba75 100644 --- a/BFS_GRAPH_using_adjacency_list__queue.cpp +++ b/BFS_GRAPH_using_adjacency_list__queue.cpp @@ -1,5 +1,5 @@ //BFS of a graph complexity o(V+E) -//Algorithm +//Algorithms #include using namespace std; //Adjacency list and visited list From 69af9301dc9ba856f362313c0749a0bc7c1b57d4 Mon Sep 17 00:00:00 2001 From: abhishek23feb <72147347+abhishek23feb@users.noreply.github.com> Date: Fri, 2 Oct 2020 21:14:18 +0530 Subject: [PATCH 3/4] Update Binary_Tree --- Binary_Tree | 1 + 1 file changed, 1 insertion(+) 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 From 8d60f32982d43cd2ea76d11e9c810237adf7e1d4 Mon Sep 17 00:00:00 2001 From: abhishek23feb <72147347+abhishek23feb@users.noreply.github.com> Date: Fri, 2 Oct 2020 21:16:06 +0530 Subject: [PATCH 4/4] Update Tree_Traversal_levelorder.cpp --- Tree_Traversal_levelorder.cpp | 1 + 1 file changed, 1 insertion(+) 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 using namespace std; struct Node{