C++ program

Using any AVL Tree

Description Write a program for a simple inventory management system based on a simple inventory ADT, as described below, using an implementation based on an AVL Tree. Simple Inventory ADT Members Description number of products (i.e., product id's, not number of items of each product) in the current inventory count [product_id] maps to the non-negative number of items for product_id currently in the inventory Description return n return value of count [product.id] return the size of the current inventory (i.e., the total number of items, count[i]) count Methods num products( available (product.id) sizeC in(product id,num.items)increase number of items of product id available by num_items: count [product_id] - count [product_id] + num_items out (product.id,numitems) decrease the number of items of product.id available by num items tmp-value = count [product-id] if tmp.value