A binary tree of height 5 has levels 0 to 5. It has the most nodes when every level is full, which is $2^6 - 1 = 63$. It has the fewest nodes when it is a single path, which is $5 + 1 = 6$.
More Trees and Binary Search Trees questions
GATE 2015 CS (CS1) Q17– Which of the following is/are correct inorder traversal sequence(s) of binary search…
GATE 2015 CS (CS1) Q35– What are the worst-case complexities of insertion and deletion of a key in a binary search…
GATE 2017 CS (CS1) Q16– Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T…
GATE 2014 CS (CS1) Q22– A rooted n-node binary tree is represented using pointers. The best upper bound for…
GATE 2014 CS (CS2) Q49– Each leaf of the shown expression tree independently has value 0 or 1. Find the maximum…
GATE 2014 CS (CS3) Q22– In the rooted tree shown, P is the root. In what order are the nodes visited during an…