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
- 71300 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
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
State the rules to be followed during infix to postfix conversions?
What do you mean by balanced trees?
What is a node in it?
How do you empty an arraylist?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What is data type with example?
What are the advantages of modularity?
Define an algorithm. What are the properties of an algorithm?
Define structure property in a heap?
Can we use ordered set for performing binary search?
Is sorting a math skill?
How do you access the values within an array?
Which data structures are applied when dealing with a recursive function?
What is meant by deque?
Write the procedure to convert general tree to binary tree?
