Adds BST and tree level order and print adjancency list of a graph solutions

Author: omonimus1

README.md

@@ -292,11 +292,13 @@ My solutions to competitive programming problems in [Geeks for Geeks](https://au
 |----------|:----------------:|
 |Binary Search |[C++](c++/bin-search.cpp)|
 |Min in BST|[C++](c++/min-in-BST.cpp)|
+|Level order of a binary search tree|[C++](c++/level-order-of-binary-search-tree.cpp)|
 |Inorder of a BST(Binary Search Tree)|[C++](c++/inorder-of-BST.cpp)|
 |PostOrder of a BST|[C++](c++/postOrder-of-BST.cpp)|
 |Preorder of BST|[C++](c++/preOrder-of-BST.cpp)|
 |Kth largest element in BST|[C++](c++/.cpp)|
 |Mirror Tree|[C++](c++/mirror-tree.cpp)|
+|Level order traversal of a tree|[C++](c++/tree-level-order-traversal.cpp)|
 |Left view of a binary tree|[C++](c++/left-view-of-binary-tree.cpp)|
 |Sum of leaf nodes (Tree)|[C++](c++/sum-of-leaf-nodes.cpp)|
 |Search Element in BST|[C++](c++/search-element-in-bst.cpp)|
@@ -321,6 +323,9 @@ My solutions to competitive programming problems in [Geeks for Geeks](https://au
 |----------|:----------------:|
 |Sum of depenncies in a graph |[C++](c++/sum_of_depencies.cpp)|
 | BFS of a graph |[C++](c++/bfs-graph.cpp)|
+|Print adjacency list|[C++](c++/print-adjacency-list.cpp)|
+| |[C++](c++/.cpp)|
+
 
 ## Math and BitMagic
 

c++/level-order-of-binary-search-tree.cpp

@@ -0,0 +1,32 @@
+// https://practice.geeksforgeeks.org/problems/levelorder-in-bst/1/?track=DSA-Foundation-Final-BST&batchId=193
+vector<int> levelOrder(Node *root) 
+{ 
+    // Level order is made applying the Breath First search
+    vector<int>s;
+    if(root == NULL)
+        s;
+    
+    // Create a queue
+    queue<Node *>myQueue;
+    // Insert the root in the queue
+    myQueue.push(root);
+    
+    Node *node;
+    // While queue is not empty: pop fron node and hten push left and right child
+    while(!myQueue.empty())
+    {
+        // Print node from queue
+        node = myQueue.front();
+        s.push_back(node->data);
+        myQueue.pop();
+        
+        // Enqeue left child
+        if(node->left != NULL)
+            myQueue.push(node->left);
+            
+        // Enque right child
+        if(node->right != NULL)
+            myQueue.push(node->right);
+    }
+    return s; 
+}

c++/print-adjacency-list.cpp

@@ -0,0 +1,14 @@
+// https://practice.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1/?track=DSA-Foundation-Final-Graph&batchId=193
+// adj: array of vectors to represent graph
+// V: number of vertices
+void printGraph(vector<int> adj[], int V)
+{
+    for(int i =0; i < V; i++)
+    {
+        cout << i;
+        for(int j =0; j < adj[i].size(); j++)
+            cout << "-> "<<adj[i][j]; 
+        
+        cout <<endl;
+    }
+}

c++/tree-level-order-traversal.cpp

@@ -0,0 +1,26 @@
+// https://practice.geeksforgeeks.org/problems/level-order-traversal/1/?track=DSA-Foundation-Final-Tree&batchId=193
+vector<int> levelOrder(Node* node)
+{
+    vector<int>s;
+    if(node == NULL)
+        return s; 
+    
+    // Apply Breadth first search algorithm
+    // Create queue and push root inside
+    queue<Node*> myQueue;
+    myQueue.push(node);
+    
+    Node *current_node; 
+    while(!myQueue.empty())
+    {
+        current_node = myQueue.front(); 
+        s.push_back(current_node->data);
+        myQueue.pop();
+        
+        if(current_node->left != NULL)
+            myQueue.push(current_node->left);
+        
+        if(current_node->right != NULL)
+            myQueue.push(current_node->right);
+    }
+}