In a max-heap, element with the greatest key is always in which node?
Asked in Mizoram PSC 3.Technical Paper-I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- The Data structure used in standard implementation of Breadth First Search is?
- In dynamic programming, the technique of storing the previously calculated values is called __________
- Which of the following problems should be solved using dynamic programming?
- If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called __________
- Depth First Search is equivalent to which of the traversal in the Binary Trees?
- Time Complexity of DFS is? (V – number of vertices, E – number of edges)
- The PreOrder and PostOrder traversal of binary tree generate the same out put. The tree can have maximum
- In a stack, if a user tries to remove an element from empty stack it is called __________