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 / vinoth kumar.r
Binary search trees care only about the inorder traversal of
the tree. And specifying inorder traversal of a tree doesnt
mean there is a unique representation of it.
5 Binary search trees are possible
| Is This Answer Correct ? | 13 Yes | 9 No |
Post New Answer View All Answers
What are the applications of b-tree?
What is circular linked list?
Tell me the difference between structure and array?
What is the procedure to insert into a sorted array?
What do you mean by priority queue?
What is structured data with example?
What is data and data types?
Describe the complexity of Quick Sort
What is the easiest sorting method to use in data structures?
Can we increase the size of statically allocated array?
Define a tree?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What is binary search in data structure?
Why is selection sort used?
How to reverse singly link list?