# Writing a linear-time boolean function for a HEAP structure

Not what you're looking for? Search our solutions OR ask your own Custom question.

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.

Â© BrainMass Inc. brainmass.com November 24, 2021, 10:59 am ad1c9bdddfhttps://brainmass.com/math/boolean-algebra/writing-a-linear-time-boolean-function-for-a-heap-structure-1653

#### Solution Summary

This job assists with writing a linear-time boolean function for a HEAP structure

$2.49