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 / hash define
12 binary trees
3 binary search trees
Is This Answer Correct ? | 10 Yes | 44 No |
Post New Answer View All Answers
Why entry interface is used in map?
Does hashset allow duplicates?
Explain the types of linked lists.
Explain the term tail recursion?
Define level of the tree?
Write the syntax in c to create a node in the singly linked list.
When would you use a tuple?
How to inverting a function in sort and searching?
What is numeric array?
Name few classes that implement collection interface?
How does linkedhashset work internally?
Define internal nodes?
Why do we need linked lists?
What is stack in data structure with the example?
Define in brief an array.