Updated README

Author: OmkarPathak

README.md

@@ -37,3 +37,14 @@ Pune, Maharashtra, India.<br />
     * [Circular Queue](Queue/CicularQueue.py)
     * [Double Ended Queue](Queue/Deque.py)
     * [Priority Queue](Queue/PriorityQueue.py)
+
+# Tree
+
+* [Tree Concept](https://github.com/OmkarPathak/Data-Structures-using-Python/blob/master/Trees/Tree.ipynb)
+    * [Tree implementation](Trees/Tree.py)
+    * [Binary Search Tree](Trees/BinarySearchTree.py)
+    * [Breadth First Traversal](Trees/P01_BreadthFirstTraversal.py)
+    * [Count Leaf Nodes](Trees/P02_CountLeafNodes.py)
+    * [Construct tree from inorder and preorder](Trees/P03_TreeFromInorderAndPreorder.py)
+    * [Finding root to leaf paths](Trees/P04_RootToLeafPaths.py)
+    * [Finding the inorder predecessor and successor](Trees/P05_InorderPredecessorAndSuccessor.py)