1 A complete graph can have1 In a tree of n nodes, how many edges are there?1 When India got independence1 Which of the following data structures can handle updates and queries in log(n) time on an array?1 Concept of Memorization is Used in Which of the Following1 What is Average case Complexity of Bubble Sort1 Queue data structure works on1 In a max-heap, element with the greatest key is always in the which node1 To represent hierarchical relationship between elements, Which data structure is suitable?1 Which of the following follows Divide-N-Conquer Approach

More Quizes

## There are two nodes for every 1 edge so for n nodes there are n-1 edges

Hope this Helps!

Amitsee full DiscussionNov 03, 2017 05:13