Help Needed In An Interview Question (Trees)

Правка en3, от siehpe, 2016-07-07 16:41:34

The question :- Find the size of the largest complete subtree in a binary tree.
A complete binary tree is a tree with all levels filled except the last which is left filled.
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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский siehpe 2016-07-07 16:41:34 0 (published)
en2 Английский siehpe 2016-07-07 16:35:47 14 (saved to drafts)
en1 Английский siehpe 2016-07-07 10:13:04 359 Initial revision (published)