Given a binary tree, find the maximum level at which tree is completely filled.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int getMaxCompleteLevel(node* node){ | |
| if(node==NULL||!(node->left)||!(node->right)) | |
| return 0; | |
| int l=getMaxCompleteLevel(node->left); | |
| int r=getMaxCompleteLevel(node->right); | |
| return 1+min(l,r); | |
| } | |
coding hangover 