Description: create a max heap class that is based on a complete ternary tree. As with a complete binary tree max heap, the
largest value is at the root and the root is at location 1 in the vector holding the heap. Location 0 is
unused.1）insert2）delete3）build
To Search:
File list (Check if you may need any files):
assign5.sln
assign5.vcproj
Client.cc
dsexceptions.h
TernaryHeap.h
test.txt
test1.txt
test2.txt
Download