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.

© SolutionLibrary Inc. solutionlibary.com 9836dcf9d7 https://solutionlibrary.com/math/algebra/writing-a-linear-time-boolean-function-for-a-heap-structure-1jl