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 / kalai
If the element is a root node ,in a 1st search it will find
the element. If the element is either a lchild or rchild it
make 2 searches.
| Is This Answer Correct ? | 2 Yes | 7 No |
Post New Answer View All Answers
How will you explain circular linked list?
What is sorting rule in shapes?
where do you use double linked list?
What are the tasks performed during inorder traversal?
Write a program to reverse a single linked list.
What are the different types of data structures?
What is dynamic array in excel?
When will you use array over arraylist?
How does a selection sort work for an array?
How does a selection sort work?
How is the front of the queue calculated ?
What is the purpose of sorting algorithms?
What is the purpose of tochararray ()?
Which sorting algorithm is used in collections sort?
What do you mean by disjoint set adt?