ALLInterview.com :: 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                      
Google
   
 
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)
Question
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  
 
Answer
# 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
Kalai
 
Answer
# 22
Not a direct answer. But you can find in depth concepts
about binary and binary search tree in this page.

http://technicalypto.blogspot.com/search?
q=binary+search+tree
 
Is This Answer Correct ?    1 Yes 6 No
Bragaadeesh
 
Answer
# 23
30 binary trees
14 binary search trees
 
Is This Answer Correct ?    1 Yes 10 No
Bittu Sarkar
 
Answer
# 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
5*6=30

1 1 1 1 1
A A A A A
2 3 2 2 2 2

A A A A
3 3 3 3

for binary search tree answer is 3
 
Is This Answer Correct ?    19 Yes 42 No
Shweta
 
Answer
# 25
12 binary trees
3 binary search trees
 
Is This Answer Correct ?    10 Yes 44 No
Hash Define
 
Answer
# 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
Kanha
 
Answer
# 27
18 Binary trees and 3 Binary serach trees. 
Is This Answer Correct ?    35 Yes 99 No
Swapna
 
Answer
# 28
one binary search tree and 9 binary trees. 
Is This Answer Correct ?    43 Yes 157 No
Prasad
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm   2
what is R-B tree Wipro 4
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
How is it possible to insert different type of elements in stack? TCS 7
Write programs for Bubble Sort, Quick sort Cognizent 15
why do tree always takes o(log n) time? TCS 1
What do you mean by: Syntax Error, Logical Error, Runtime Error? Microsoft 7
how to find the number of possible tree in the given tree. Wipro 12
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
what is AVL tree? ADS 5
how to search an element in sorted linked list with time complexity is O(log n). Wipro 3
What are the parts of root node? BMC 7
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 


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

ALLInterview.com   ::  KalAajKal.com