Updated Readme file

Love Babbar DSA Sheet/6. Binary Trees/code.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+/*Ques - Given a binary tree, find its level order traversal.
+
+Input - 1 3 2 -1 -1 -1 -1  
+
+Output - 1 3 2
+*/
+
+
+
+int main(){
+
+  return 0;
+}

Love Babbar DSA Sheet/README.md

@@ -1 +1,3 @@
-# DSA-cheatsheet
+# Love Babbar DSA sheet
+I highly suggest everyone to view the video below before starting this section.
+[https://www.youtube.com/watch?v=4iFALQ1ACdA&t=431s](https://www.youtube.com/watch?v=4iFALQ1ACdA&t=431s)

README.md

@@ -28,13 +28,23 @@ The below table includes all the topics that is in [Learning C++ with DSA](https
 | S.No | Topics | 
 | ------ | ------ |
 | 1 | [Mathematics](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/1.%20Mathematics) | 
+
 | 2 | [Bit Magic](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/2.%20Bit%20Magic) | 
+
 | 3 |  [Recursion](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/3.%20Recursion) | 
+
 | 4 | [Arrays](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/4.%20Arrays/Arrays%20problem%20for%20intterview) | 
+
 | 5 | [Linked List](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/5.%20Linked%20List) | 
+
 | 6 | [Stack](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/6.%20stack) | 
+
 | 7 | [Queue](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/7.%20Queue) |
+
 | 9 | [Trees](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/8.%20Trees) |
+
+| 10 | [Binary Tree](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/9.%20Binary%20Tree) |
+
 | 10 | [Algorithms](https://github.com/karan320/DSA-cheatsheet/tree/master/Learning%20C%2B%2B%20with%20DSA/Algorithms/Sorting) |