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 / bittu sarkar
30 binary trees
14 binary search trees
| Is This Answer Correct ? | 1 Yes | 10 No |
Post New Answer View All Answers
Sorting is not possible by using which of the methods?
Which sorting is best?
What is an acyclic graph?
Why would we use dynamically allocated arrays vs vectors?
Explain binary tree traversals?
What is ds heap sort?
What data structure does a binary tree degenerate?
How do I remove a value from a list?
Is list a data type?
Is hashmap keyset ordered?
Explain implementation of deletion from a binary tree.
How do you sort elements in an arraylist?
What is a map programming?
Why do we use stacks?
Define collision in hashing?