Objectives:
Implement the new class type: LazySearchTree based on FHsearch_tree by enabling lazy deletion.
Implement the new class: LazySTNode based on FHs_treeNode as an inner class in LazySearchTree.
Complete the implementation of the class(es): SuperMarket.
Practice adding and removing items from a Binary Search Tree (BST).
For extra credit define a new class type: FoothillTunesStore which will store a BST.
For extra credit use your lazy implementation of BST to store SongEntry objects.
Material from:
Syllabus and Program Guidelines.
Material from Week 4 (Part 2) and Week 5 (Part 1) modules.
Material from Chapter 4 of Weiss Book up to (but not including) discussion on AVL trees.
Material from FHsearch_tree class and FHs_treeNode class in modules.
SuperMarket and Item class and example data files (included under the resource folder) in your assigned GitHub
repository.
And， there is the example link：https://github.com/dixonzhao/Basic_Study/tree/8c1399514bcb0366cb762e1b4d1c9db3bf5062d0/05_Computer%20Alghorithm/dixonzhao-cs1c-project05-master
0 comments