Question
Task C Search is a very efficient operation in AVL Trees. Implement a Console Application which uses an AVL tree and allows to keep track,
Task C
Search is a very efficient operation in AVL Trees. Implement a Console Application which uses an AVL tree and allows to keep track, in an efficient way, products and quantities present in a store. The application must have a menu driven interface which allows the user to: (i) Add and store the name of a product into an AVLTree (assume that the name of the product is a string, eg laptop). The user is allowed to add multiple times the same product. (ii) Check if a product is present in the tree (the user must input the name of the product to search) and, if present, display the number of times that the product has been added into the tree.
Hints: Before attempting the methods, make sure you have fully implemented the class AVL tree with working left and right rotations. Remember to keep track of the number of times that a product has been added to the tree. Eg, if laptop has been added to the tree 4 times, then the number of occurrences of the product (4) should also be stored in the tree.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started