Build the Binary Search Tree that has the Least Search Cost.
Implement the Heap/Shell Sort Algorithm.
Implement all the functions of a dictionary (ADT) using hashing.
Perform DFS and BFS : Graph using adjacency matrix/list.
Use adjacency list representation of the graph or use adjacency matrix representation of the graph.
Hash Table Implementation : Create Telephone book database.
Load More That is All