Project-BST-and-DFS_BFS

Project 1- Binary Search Tree implement all opertions(insertion, searching, deletion, inorder, preorder, postorder, traversing, inorder predecessor and successor, maximum and minimum value of BST.

Project 2- Breadth First Search(BFS) and Depth First Search(DFS)