checkout
view
Your Cart: item(s)
Computer Science, Data Structures and Algorithms
Year 2
Writing a linear-time boolean function for a HEAP structure.
Write a linear-time Boolean function HEAP(T:BINARY_TREE) which returns TRUE is T is a heap, i.e., it is partially ordered. Assume that T is represented using pointers to left and right children. Prove that the time is really linear.
By OTA: Jie Xiong, MSc (IP)
OTA Rating: 3.1/5
What's included:
- Plain text response
- Attachment(s):
- data-sol4.doc
Page generated in 0.0116 seconds