Explore BrainMass
Share

Writing a linear-time boolean function for a HEAP structure

This content was STOLEN from BrainMass.com - View the original, and get the solution, here!

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 September 20, 2018, 1:56 am ad1c9bdddf - https://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.19