How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
Answer Posted / moru laxmi narayana
18 binary trees,5 binary search trees
| Is This Answer Correct ? | 1 Yes | 3 No |
Post New Answer View All Answers
What is variable size arrays?and why we use it?
How to reverse a singly linked list?
Why do we use linked lists?
What is the Difference between treemap and hashmap?
How many null values are allowed in a set?
What is the use of hashtable?
How do you clear a stack?
How do I remove a value from a list?
Why quicksort is called quick?
Where the data structures are used?
What is bubble sort used for?
What is a simple graph?
Why hashmap is faster than hashset?
Is priority queue sorted?
What is data structure in programming language?