Question: ( 6 % ) A complete binary tree B containing 1 0 0 nodes ( with indices 1 , 2 , . . . ,
A complete binary tree B containing nodes with indices is stored in an onedimension array. Let node i be in position of the array array is empty
A What is the height of tree
B What is the index of the parent of array
C How many nodes are leaf nodes?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
