:: 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 (340)
 Linux interview questions  Linux Interview Questions (451)
 Unix interview questions  Unix Interview Questions (458)
 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)
How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
 Question Submitted By :: Data-Structures
I also faced this Question!!     Answer Posted By  
# 21
If the element is a root node ,in a 1st search it will find
the element. If the element is either a lchild or rchild it
make 2 searches.
Is This Answer Correct ?    2 Yes 7 No
# 22
Not a direct answer. But you can find in depth concepts
about binary and binary search tree in this page.
Is This Answer Correct ?    1 Yes 6 No
# 23
30 binary trees
14 binary search trees
Is This Answer Correct ?    1 Yes 10 No
Bittu Sarkar
# 24
for no. of different binary tree---
for n nodes the formula is 2^n-n in this formula value of
nodes are not considered, only the way nodes can be present
in a tree so for 3 nodes there can be 5 ways, for each way
no. of possibilty of values is 3! so answer comes out to be

1 1 1 1 1
2 3 2 2 2 2

3 3 3 3

for binary search tree answer is 3
Is This Answer Correct ?    19 Yes 42 No
# 25
12 binary trees
3 binary search trees
Is This Answer Correct ?    10 Yes 44 No
Hash Define
# 26
for binary tree answer is n! ways that is 3!=6

For Binary search tree n ways..that is 3
Is This Answer Correct ?    17 Yes 52 No
# 27
18 Binary trees and 3 Binary serach trees. 
Is This Answer Correct ?    35 Yes 99 No
# 28
one binary search tree and 9 binary trees. 
Is This Answer Correct ?    43 Yes 157 No

Other Data Structures Interview Questions
  Question Asked @ Answers
why do tree always takes o(log n) time? TCS 1
Which sort show the best average behavior?   9
What is a data structure? Keane-India-Ltd 12
Why enum can not be used directly with printf function?   3
difference between the run time polymorphism and compile time poly morphism and about virtual function. CybAge 2
Tell me real world example of polymorphism and encapsulation . CybAge 7
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? CTS 3
what is atmost complete binary tree?   6
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?   17
sir plz. send me a bunch of questions related to this topic which may help me in campus selection ABC 1
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Morgan-Stanley 11
Explain about the types of linked lists   5
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.   ::