algorithm - Number of nodes in the bottom level of a balanced binary tree -
i wondering 2 questions came when studying binary search trees. following: what maximum number of nodes in bottom level of balanced binary search tree n nodes? what minimum number of nodes in bottom level of balanced binary search tree n nodes? i cannot find formulas in textbook regarding this. there way answers these questions? please let me know. assuming it's full binary tree , number of nodes in leaf equal (n/2)+1 . for minimum number of nodes, total number of nodes 1 (satisfying condition should balanced tree).