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
- 71412 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
How to increase stack limit in w3wp.exe?
What are the categories of avl rotations?
Define circular list?
Explain Linked List
What is a node in it?
What are the main differences between the linked list and linear array?
In an avl tree, at explain what condition the balancing is to be done?
What is the time complexity of hashmap get () and put () method?
Define path in a graph?
Why is arraylist used?
Does hashmap maintain insertion order?
How would you sort words in a large file?
What is meant by strongly connected in a graph?
Is sorting a math skill?
Is quicksort a stable algorithm?
