State the properties of a binary tree?
No Answer is Posted For this Question
Be the First to Post Answer
List the two important key points of depth first search?
Why do we need to use computers to help us sort lists?
What is difference between array and arraylist?
How do you explain bubble sort?
What are the different binary tree traversal techniques?
What are the tasks performed while traversing a binary tree?
What do you mean by primary clustering?
Can we add heterogeneous elements into treemap?
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.
Can we apply binary search algorithm to a sorted linked list, why?
What is array and its types in data structure?
How many types of data structures are used?