notes write method and the corresponding recursive function to traverse binary tree (in whatever order you find convenientand dispose of all its nodes use this method to implement binary_tree destructor consider heap of keyswith xk being the key in position (in the contiguous representationfor < prove that the height of the subtree rooted at xk is the greatest integer not exceeding lg( /( ))for all satisfying < " heap can be used as priority queuethe highest priority item is at the root and is trivially extracted discuss "the enqueue method of the binaryheap class takes as its argument the item to be inserted in the heap explain answersself assessment binary tree closely related smallest key dequeuemin simulation position priority queue array subscript further readings books brian kernighan and dennis ritchiethe programming languageprentice hall burkhard moniendata structures and efficient algorithmsthomas ottmannspringer krusedata structure program designprentice hall of indianew delhi mark allen welesdata structure algorithm analysis in csecond ed addisonwesley publishing rg dromeyhow to solve it by computercambridge university press shi-kuo changdata structures and algorithmsworld scientific shi-kuo changdata structures and algorithmsworld scientific sorenson and tremblayan introduction to data structure with algorithms thomas cormencharles eleiserson ronald rivestintroduction to algorithms prentice-hall of india pvt limitednew delhi timothy buddclassic data structures in ++addison wesley online links www en wikipedia org www web-source net www webopedia com lovely professional university