• Placement Papers
• /
• TCS
• /
• Programming
• /
• Technical

TCS Question Papers: TCS Interview Experience(91) TCS Company Profile

(#M40031786) TCS Programming question tcs Keep an EYE

Q. Minimum number of leaf nodes in a binary search tree of n nodes

Asked In TCS naresh (11 years ago)

Unsolved Read Solution (19)

Is this Puzzle helpful?   (14)   (1) Submit Your Solution Technical

Read Solution (19) :

Supriya Panguddi  (10 years ago)

(n+1)/2

ex:if n=3, then leaf nodes=(3+1)/2=2

Is this solution Helpfull? Yes (7) | No   

tallapakavasavi  (11 years ago)

Binary tree Must Contain Exactly 2 childrens So Minimun Number of Leaf Nodes in a Binary Tree Will be 2

Is this solution Helpfull? Yes (4) | No (5)  

Nimbagallu Prasanna kumar  (11 years ago)

answer is 1

Is this solution Helpfull? Yes (4) | No (1)  

naresh  (11 years ago)

Please give correct explanations...multiple answers will give confusion

Is this solution Helpfull? Yes (3) | No   

Pooja  (10 years ago)

k=no. of level in binary tree.
n=2^k-1
2^k=n+1
no of leaf nodes=2^(k-1)=2^k/2=(n+1)/2

Is this solution Helpfull? Yes (3) | No   

Pratanu Ranjan De  (11 years ago)

1
as for n nodes=>minimum nodes in the last level is 1

Is this solution Helpfull? Yes (2) | No (2)  

saranya sankar  (11 years ago)

ans is n-1

Is this solution Helpfull? Yes (2) | No (5)  

Krishna Tandon  (11 years ago)

n=h+1
where h=height of the tree.
if h=0, i.e if the node is at 0th level, then there will be only one node and that will be the child node.

so, minimum number of leaf node(s) in a binary search tree of n nodes = 1

Is this solution Helpfull? Yes (2) | No   

Keerthi  (11 years ago)

n-1 nodes

Is this solution Helpfull? Yes | No (2)  

varalakshmi  (11 years ago)

n-1 for binary search tree

Is this solution Helpfull? Yes | No (2)  

rohit sakhi  (11 years ago)

(2^n)-1) n is the hight of tree for n=1 there is only one node that is 2^0=1 similarly for n=3 there is no. of node is 7 that is (2^3)-1)=7

Is this solution Helpfull? Yes | No (1)  

sumit  (11 years ago)

(n+1)/2 nodes

Is this solution Helpfull? Yes | No (1)  

abhishek singh  (11 years ago)

IF A LEAF NODES THEN A-1 NON LEAF NODES SO.A+A-1=N,A=N+1/2 IS THE ANSWER....

Is this solution Helpfull? Yes | No (1)  

abdul haseeb  (11 years ago)

n+1, for 1 node der will be 2 leaf nodes, similarly, for 3 nodes(ie 1root+2children)der will be 4 leaf nodes...

Is this solution Helpfull? Yes | No (1)  

Mukesh Kumar  (10 years ago)

2^N;
there will be two child nodes for every parent node.At root level 1 i.e. 2^0 , then 2 i.e. 2^1 then 4 i.e. 2^2 and so on next levels...

Is this solution Helpfull? Yes | No   

Archana Gehlot  (10 years ago)

(2^n-1)nodes

Is this solution Helpfull? Yes | No   

Indumathi  (10 years ago)

the binary tree contains two child nodes
so,the binary tree contains 2 leaf nodes

Is this solution Helpfull? Yes | No   

Ashutosh Mishra  (5 years ago)

minimum no of leaf node is n-1

Is this solution Helpfull? Yes | No   

popuri dharani kishori  (5 years ago)

Assuming that for λ=k we have a minimum of N=2k+1 nodes, if we add a node, it must branch from one of the leaves. But in order to maintain a full binary tree, we must add an additional node; that is, adding an additional levels requires at minimum two more nodes. So, we will have N+2 nodes.

Is this solution Helpfull? Yes | No   

Please Login to Read Solution.