For a k-ary tree with height h, the upper bound for the maximum number of leaves is: — k^h

This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university