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
- 77178 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Write code for reversing a linked list.
Write an algorithm to find middle element in the linked list.
What is push and pop in stack?
What is vector and types of vector?
What are control structures?
What is sequential mapping in data structure?
What are the pre-requisite for the collection to perform binary search?
What sort does arrays sort use?
What are sorting algorithms used for?
What is the difference between 1d and 2d array?
Can the double-checked locking fail on a single processor system?
What is the difference between b tree and binary search tree?
Can we increase the size of statically allocated array?
Which one is the simplest sorting in data structure?
Is hashmap synchronized?
