The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes ________ is . (answer in integer)
Solution :
The correct option is 11.
Let us understand the definition of a full binary tree and how we can achieve the maximum possible height for a given number of nodes.
A full binary tree (sometimes called a proper or 2-tree) is a binary tree in which every node has either 0 or 2 children. In other words, no node in a full binary tree has only one child.
We are given that the tree has nodes, and we want to find the maximum possible height of this tree. The height of a binary tree is defined as the number of edges on the longest path from the root to a leaf node.
To maximize the height of a full binary tree with a fixed number of nodes , we must make the tree as skewed as possible. In a full binary tree, to extend the height by 1 at each step while maintaining the full binary tree property, we must add exactly 2 children to a leaf node at each level.
Let us construct the tallest full binary tree step-by-step:
At level 0 (the root): we have 1 node. To make it a full binary tree, it must have 2 children (at level 1), or be a leaf. Since we want to maximize height, we add 2 children.
Now we have 3 nodes in total, and the height is 1.
To increase the height to 2, one of the nodes at level 1 must have 2 children. The other node at level 1 remains a leaf (0 children).
This adds 2 more nodes, making the total number of nodes 5, and the height becomes 2.
Continuing this process, at each step we select one leaf at the deepest level and give it 2 children. This increases the height by 1 and adds exactly 2 nodes to the tree.
In general, for a full binary tree of maximum height , the relationship between the number of nodes and the height is given by the formula:
We can rearrange this formula to solve for the height in terms of :
Substituting the given value of nodes into the equation:
Thus, the maximum possible height of a full binary tree with 23 nodes is 11.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.