A pseudo-complete binary tree is a binary tree that becomes a perfect tree when the bottom level is removed. Consider the OBST problem for the sorted array aa1 < aa2 < ⋯< aann where all the qqii’s are equal to 0 and all the ppii’s are equal to 1 nn. Prove that the optimal binary search trees in this case are the pseudo-complete binary search trees.

susie has 7 apples

9x

mgxmgzmgzzzlgxhhhx. dlulhx

hi there

the slope is 1/3.

this is because from the y-intercept, you go up one, and you go to the right three, to get to the next exact point on the graph. this is known at the “rise over run.”

p.s. (if you need it).your y-intercept is -2, because that is the point on the graph where the line crosses the y-axis.

hope that : )