:: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Categories >> Software >> Operating Systems >> Data Structures


 Windows interview questions  Windows Interview Questions (339)
 Linux interview questions  Linux Interview Questions (451)
 Unix interview questions  Unix Interview Questions (455)
 Solaris interview questions  Solaris Interview Questions (781)
 RTOS interview questions  RTOS Interview Questions (43)
 Bulnex interview questions  Bulnex Interview Questions (4)
 Operating Systems General Concepts interview questions  Operating Systems General Concepts Interview Questions (261)
 Data Structures interview questions  Data Structures Interview Questions (67)
 Operating Systems AllOther interview questions  Operating Systems AllOther Interview Questions (48)
What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
 Question Submitted By :: Data-Structures
I also faced this Question!!     Answer Posted By  
# 1

if N=0; it is 2-1=1,1 is the max no of node in the tree
if N=1; it is 4-1=3, 3 is the max no of nodes in the tree
if N=2; it is 8-1=7, 7 is the max

and it goes like that...........
Is This Answer Correct ?    97 Yes 5 No
Salmiya Thilsath.a
# 2
(2 pow n)-1,if root level is one and (2 pow n+1)-1, if root
level is zero.
Is This Answer Correct ?    23 Yes 9 No
Asharani K P
# 3
Suppose level is 2 then total number of nodes will be
1 root
2 left of root and right of root
2 left and right of left of root
2 left and right of right of root
so total nodes are 1+2+2+2=7

by formula (2^(2+1))-1
Is This Answer Correct ?    21 Yes 8 No
Gaurav Gupta
# 4
Is This Answer Correct ?    17 Yes 6 No
# 5
2^N -1 
Is This Answer Correct ?    12 Yes 6 No
Gopala Krishnan
# 6

In a tree a node can have any number of nodes independent
of the levels.
Is This Answer Correct ?    7 Yes 3 No
S. Sadagopan
# 7
if tree is binary tree then maximum no.of node is 2^(N+1)-1 
Is This Answer Correct ?    4 Yes 0 No
Bipin From Utkal University Mc
# 8
to be more generic this kind of problem is best solved

To point out that 2 ^ N AND 3 ^ N are both wrong,
here's a few examples: (the exponet is the amount of levels)
2^0 = 1, correct
2^1 = 2, incorrect, should be 3
2^2 = 4, incorrect, should be 7

And a tree with three children
3^0 = 1, correct
3^1 = 3, incorrect, should be 4
3^2 = 9, incorrect, should be 13

Looking at that I'm sure you can see the pattern.
C = "Number of Possible Children"
N = Levels


or in C++ code
int NodeCount(int C, int N)
if (N < 0) return 0
return NodeCount(C, N-1) + C^N
Is This Answer Correct ?    7 Yes 4 No
# 9
If root is at level 0 then :
Case 0:
When level is 1 max nodes is 1
Case 1:
When level is 1 then max would be 3.
Case 2:
When level is 2 then max nodes would be 7

So formula would be 2^(n+1) -1

Is This Answer Correct ?    5 Yes 3 No
Vaishali Naidu
# 10
Is This Answer Correct ?    1 Yes 0 No

Other Data Structures Interview Questions
  Question Asked @ Answers
How is it possible to insert different type of elements in stack? TCS 7
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?   17
Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?   4
simple algorithm for bubble sort?   1
Write programs for Bubble Sort, Quick sort Cognizent 15
What are the parts of root node? BMC 7
What is a data structure? Keane-India-Ltd 12
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel 22
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? iGate 28
Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?   4
How would you sort a linked list?   4
how to search an element in sorted linked list with time complexity is O(log n). Wipro 3
For more Data Structures Interview Questions Click Here 

Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
Copyright 2013  All Rights Reserved.   ::