Only the roots of the
tree
remains .(begin: All..)
Answers
Answered by
2
Answer:Start pointers from all leaf nodes and move one step inside each time, keep ... So we can have only one root or at max two root for minimum height depending on tree structure as explained above. ... loop untill total vertex remains less than 2.
Explanation:
Similar questions