You want to insert a new item in a binary search tree. How would you do it?
- 0 Answers
- 536 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is the meaning of anonymous array? Explain with an example?
Is vector a collection?
Define indegree of a graph?
What is int data type?
why it is difficult to store linked list as an array?
In what scenario, binary search can be used?
Are data structures important?
Define avl tree?
Is array a data structure?
What is an expression tree?
Which interface provides the capability to store objects using a key-value pair?
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.
Windows 
