In DSA Project i have made dictionary in binary search tree data structure because its searching time complexity is just O(log(n)) and In dictionary user can insert ,delete, traverse and search the dictionary word in this project as well as i have made comparison this data structure with Queue data structure because time complexity of searching in Queue is O (n) .
In DSA Project i have made dictionary in binary search tree data structure because its searching time complexity is just O(log(n)) and In dictionary user can insert ,delete, traverse and search the dictionary word in this project as well as i have made comparison this data structure with Queue data structure because time complexity of searching in Queue is O (n) .