you doesnot apply vector, unordered$\_$map $,$ climits $,$map,set $,$ stdexcept, algorithm libraries.

you must be implement by using templates in classes and functions and donot use structs

You have to apply appropriate data structures and algorithms to construct an online groceries store where the system should not only be able to manage the grocery items but also cater for their online delivery to customers

Customer:

The information kept about each borrower would include the following info:

$$CNIC number

$$Name

$$Mobile number

$$Address

Your system should store above features against each customer using an appropriate search structure. If you use a Binary Seach Tree please input data from a file such that the height of the resulting BST is as

close to log$($n$)$as possible.

GroceryItem:

The data kept about books is as follows:

$$barcode

$$title

$$unit price

$$quantity available

Your system should store above features against each groceryItem in a data structure where data access time is no worse than O$(1).$

Groceries Delivery:

Add functionality for the customers where they will be able to get the groceries delivered from the store to their respective addresses. The map of each student doing this project should be different and consist of atleast $10$nodes$.$Once loaded your source would be the store location and destination would be the customer$$s address. Your system should generate the shortest path between the source and

destination to give to one of its drivers for delivery purpose.

Objectives:

$2.$Write program for the functionalities of insert$/$update$/$delete operations

$3.$Add functionality of search where a grocery item can be searched by barcode$/$title or both.

$4.$Display the path that a rider would take to deliver an order.

$5.$Update the quantity available once a grocery item has been sent for successful delivery

Requires understanding of data

structures $($e$.$g$.,$Binary Search Tree, hash tables$)$for customer

and grocery item storage, and graph algorithms for delivery path

finding.

Suggested use of

BST to carry Customer data with log$($n$)$performance$.$