Data Structure I Practice Test 7

1. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.

2. What is the worst case of finding the nearest neighbour?

3. How many strategies are followed to solve a dynamic equivalence problem?

4. Can leaf node be called child node in a ternary tree?

5. Which one of the following is the correct formulae to find the parent node at index I?

6. The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?

7. State the complexity of algorithm given below.

	int function(vector<int> arr)
	int len=arr.length();
	if(len==0)
	return;
	temp=arr[len-1];
	arr.pop_back();
	return temp;

8. Time taken in decreasing the node value in a binomial heap is

9. An expression tree is created using?

10. In which year was Van Emde Boas tree invented?