Interested to Buy Any Domain ? << Click Here >> for more details...
How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
- 28 Answers
- 78211 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / kalai
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 |
Answer / bragaadeesh
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 |
Answer / shweta
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 |
Answer / kanha
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 |
Explain the term binding time?
What is the heap in data structures?
In the given binary tree, using array you can store the node 4 at which location? 1 2 3 - - 4 - - 5
Can arraylist be empty?
What does it mean to sort an array?
Explain the uses of matrix with an example?
Define forest?
What do u mean by data type?
What is a bubble sort and how do you perform it?
What is the impact of signed numbers on the memory?
What are vectors used for in real life?
Why insertion is faster in linked list?
Windows 
