Update README.md

Author: GouravRusiya30

README.md

@@ -182,25 +182,14 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 101  | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)                                                 | [Java](./Java/symmetric-tree.java)<br>[Python](./Python/101.SymmetricTree.py) | _O(n)_    | _O(n)_    | Easy       | Tree, Breadth-first Search, Depth-first Search |      |
 | 144  | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)                 | [Java](./Java/binary-tree-preorder-traversal.java)                            | _O(n)_    | _O(logn)_ | Medium     | Binary Tree, Stack                             |      |
 | 145  | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)               | [Java](./Java/binary-tree-postorder-traversal.java)                           | _O(n)_    | _O(logn)_ | Hard       | Binary Tree, Stack                             |      |
-| 103  | [ZigZag Level Order](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)                   | [JavaScript](./JavaScript/Binary-Tree-ZigZag-Traversal.js)                    | _O(n)_    | _O(n)_    | Medium     | Binary Tree                                    |      |
+| 103  | [ZigZag Level Order](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)                   | [JavaScript](./JavaScript/Binary-Tree-ZigZag-Traversal.js)   <br> [C++](./C++/binary-tree-preorder-traversal.java)      | _O(n)_    | _O(n)_    | Medium     | Binary Tree                                    |      |
 | 129  | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)                             | [Java](./Java/sum-root-to-leaf-numbers.java)                                  | _O(n)_    | _O(logn)_ | Medium     | Binary Tree, Depth First Search                |      |
 | 307  | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)                             | [Java](./Java/Range-Sum-Query-Mutable.java)                                   | _O(logn)_ | _O(n)_    | Medium     | Segment Tree                                   |      |
 | 919  | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/)                   | [Java](./Java/complete-binary-tree-inserter.java)                             | _O(n)_    | _O(n)_    | Medium     | Tree                                           |      |
 | 124  | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)                     | [C++](./C++/Binary-Tree-Maximum-Path-Sum.cpp)                                 | _O(n)_    | _O(n)_    | Hard       | Tree                                           |      |
 | 1028 | [Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/) | [C++](./C++/Recover-a-Tree-From-Preorder-Traversal.cpp)                       | _O(n)_    | _O(n)_    | Hard       | Tree                                           |      |
-
-| #   | Title                                                                                             | Solution                                                   | Time      | Space     | Difficulty | Tag                                            | Note |
-| --- | ------------------------------------------------------------------------------------------------- | ---------------------------------------------------------- | --------- | --------- | ---------- | ---------------------------------------------- | ---- |
-| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)     | [Java](./Java/binary-tree-inorder-traversal.java)          | _O(n)_    | _O(logn)_ | Medium     | Binary Tree, Stack, HashTable                  |      |
-| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)                                   | [Java](./Java/symmetric-tree.java)                         | _O(n)_    | _O(n)_    | Easy       | Tree, Breadth-first Search, Depth-first Search |      |
-| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)   | [Java](./Java/binary-tree-preorder-traversal.java)         | _O(n)_    | _O(logn)_ | Medium     | Binary Tree, Stack                             |      |
-| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Java](./Java/binary-tree-postorder-traversal.java)        | _O(n)_    | _O(logn)_ | Hard       | Binary Tree, Stack                             |      |
-| 103 | [ZigZag Level Order](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)     | [JavaScript](./JavaScript/Binary-Tree-ZigZag-Traversal.js) | _O(n)_    | _O(n)_    | Medium     | Binary Tree                                    |      |
-| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)               | [Java](./Java/sum-root-to-leaf-numbers.java)               | _O(n)_    | _O(logn)_ | Medium     | Binary Tree, Depth First Search                |      |
-| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)               | [Java](./Java/Range-Sum-Query-Mutable.java)                | _O(logn)_ | _O(n)_    | Medium     | Segment Tree                                   |      |
-| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/)     | [Java](./Java/complete-binary-tree-inserter.java)          | _O(n)_    | _O(n)_    | Medium     | Tree 
-| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)   | [C++](./C++/binary-tree-preorder-traversal.java)         | _O(n)_    | _O(n)_ | Medium     | Binary Tree, Stack  
 | 968 | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/)     | [C++](./C++/Binary-Tree-Cameras.cpp)          | _O(n)_    | _O(logn)_    | Hard     | Binary Tree, Dynamic Programming  
+  
 
 <br/>
 <div align="right">