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

Not what you're looking for?

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.

##### Purchase this Solution

##### Solution Summary

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

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Probability Quiz

Some questions on probability

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.