Share
Explore BrainMass

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.

Solution Summary

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

$2.19