Answer:
Complete design is attached below.please have a look.
Explanation:
Answer:
top down approach
Explanation:
Top down approach is process of breaking down system into sub-system which helps in formulating the overall system. At the end every sub system can be refined with more details.
While bottom up approach is process of gathering systems to design large complex system.
Top down is better as basic information is present and resources can be utilized effectively without impacting maintennance and operations.
ioq8oy because of the haoss
Explanation:
Answer:
Some differences between Heap and Binary search trees are as following:-
A heap is a complete binary tree.While a Binary Search Tree may be a complete,prefect binary tree.
A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum.While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.
