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
- 77899 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
Tell me why can't constant values be used to define an array's initial size
Write code for reversing a linked list.
Is hashmap synchronized?
How do you check if a stack is empty or not?
Can arraylist contain duplicates?
How does a dynamic array work?
What is the difference between ienumerable and list?
Which is better hashmap or hashtable?
What is the slowest sorting algorithm?
Define structure property in a heap?
How can you insert a node at the end of linked list?
What is sequential sorting?
What is difference between static and dynamic array?
What are different types of algorithms?
What do you mean by balance factor of a node in avl tree?
