The question :- Find the size of the largest complete subtree in a binary tree.<br>↵
A complete binary tree is a tree with all levels filled except the last which is left filled.<br>↵
I tried a postorder type approach but there were just too many cases to handle. I could not find the answer on google so I decided to ask it here
A complete binary tree is a tree with all levels filled except the last which is left filled.<br>↵
I tried a postorder type approach but there were just too many cases to handle. I could not find the answer on google so I decided to ask it here
