# Binary Search Tree

Class Bst implemented binary search tree

Methods/ Operations implemented:

		void insert(int value) - Inserts new node with specified value in the tree

		void inOrder() - In order traversal of tree

		void preOrder() - Pre order traversal of tree

		void postOrder() - Post order traversal of tree

		void levelOrder() - Level order traversal of tree

		~Bst() - Destructor - deallocates tree

		void deleteKey(int key) - Deletes key k from tree 

		Node* find(int key) - Finds key in tree and returns pointer to its node if it exists. Otherwise returns null

	

Add read me for binary search tree
Add read me for binary search tree
