Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 78161 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
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
Define a binary tree?
What is dangling pointer and how to avoid it?
Why is reflection slower?
What is internal and external sorting?
What is binary tree in computer science?
what is the difference between dynamic as well as non - dynamic data structures.
What are the types of linked list?
How to sort 1 million floating point numbers?
How will you explain circular linked list?
What is hashing technique? Describe in brief.
How is heap sort implemented?
How can you insert a node in a random location of the linked list?
Difference between arrays and linked list?
What is sort in data structure?
Define degree of the node?
