How does minimum size in Q6 is 2^n-1?As every node,requires 1 space and there are total of n nodes,so shouldnot it be O(n)
Min size in Q6?
here refer this @TusHar-AroRa-2294450460870717
https://www.google.com/amp/s/www.geeksforgeeks.org/data-structures-binary-trees-question-22/amp/
i hope your doubt is cleared if yes don’t forget to mark it as resolved 