인하대 데이터구조 9주차 Homework3 Maxheap

소개

"인하대 데이터구조 9주차 Homework3 Maxheap"에 대한 내용입니다.

목차

1. Problem definition

2. Algorithm and simple code description(function’s role)
1) How to solve the problem(Algorithm)
2) Simple code description(function’s role)

3. Results and results screen

4. Conclusion

본문내용

: Write a program that handles Max Heaps consisting of different integers. It receives commands from stdin, excutes each command, and outputs the appropriate answers to stdout.
⦁Command Type: (x is any unique integer value)
I x : Insert x into Max Heap
D : Delete root from Max Heap
T : Output max value, do not remove it
D i : Delete ith max value from heap
T i : Output ith max value from heap, do not remove it
P : Print out all elements from root to node in level order and do no change them in Max Heap.
Command & command output:

참고자료

· 없음