Question

Algorithm Question:

Please do not write a real program.

The answer should be an explaination of your algorithm or pseudocode. Try to answer clearly and concisely. Thank you very much.

Question:

We are given a binary tree with height larger than h. Give an algorithm
that finds a subtree of height h and among such tree, it returns the one with least
number of elements.

Answer 1

The pseudocode for the above description is as follows:

Pseudocode:

1. Height of binary tree h.

2. Count the number of nodes in the binary tree as count.

3. Initialize the array of nodes in arr[];

4. for(i=0 ; i<arr.length ; i++)

subtree = arr[i];

if(subtree has adjacent node)

then add it in the array

temp[] = arr[i];

else

move forward;

  

5. Output the shortest temp[] which will be the subtree.

Rate an upvote.....Thankyou

Hope this helps.....