Commit fe21aa1

committed

Update Readme.md

1 parent a6f0412 commit fe21aa1Copy full SHA for fe21aa1

File tree

-0

lines changed

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,6 +18,7 @@ In this repo I upload everything I do related to data structures and algorithm t`
`18`	`18`	`* Data Structure & ALgorithm Implementation`
`19`	`19`	`* [Linked List](#linked-list)`
`20`	`20`	`* [Tree](#tree)`
	`21`	`+ * [Binary Search Tree](#binary-search-tree)`
`21`	`22`
`22`	`23`
`23`	`24`	`# Linked List`
`@@ -43,6 +44,8 @@ In this repo I upload everything I do related to data structures and algorithm t`
`43`	`44`	`\| [Binary Tree By LinkedList](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/Tree/BinaryTreeLL.py) \| :white_check_mark: \| :white_check_mark: \|`
`44`	`45`	`\| [Binary Tree By PythonList](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/Tree/BinaryTreePL.py) \| :negative_squared_cross_mark: \| :negative_squared_cross_mark: \| -->`
`45`	`46`
	`47`	`+# Binary Search Tree`
	`48`	`+* :white_check_mark: [Binary Search Tree](https://github.com/sushant097/Data-Structure-Algorithms-Collections-Python/blob/master/BinarySearchTree/BST.py)`
`46`	`49`
`47`	`50`	`# Contributing`
`48`	`51`	`I appreciate feedback on potential improvements and/or if you see an error that I've made! Also if you would like to contribute then do a pull request with algorithm implementation & tests! :)`

Comments

(0)