Question: Given an n-node binary tree with all its levels full of nodes except for the last one that is missing the two rightmost nodes,

Given an n-node binary tree with all its levels full of nodes except for the last one that is missing the two

Given an n-node binary tree with all its levels full of nodes except for the last one that is missing the two rightmost nodes, as in the figure: O 1 1 O 1 O O O O O O 00 0 Suppose that this tree stores n different real numbers (notice that n is always odd). Explain where the MEDIAN of these number may be located if (i) the tree is a max-heap; (ii) the tree is a binary search tree.

Step by Step Solution

3.40 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

iAs per the given tree no of leafs no of internal nodes 1 so since n is always od... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!