Question

Draw the complete undirected graphs on one, two, three, four and five
vertices. Prove that the number of edges in an n vertex complete graph is n(n-1)/2.
Sort the following list using Quick Sort technique, displaying each step. 20, 12, 25 6, 10, 15, 13​

Answer 1

Answer:

Draw the complete undirected graphs on one, two, three, four and five

vertices. Prove that the number of edges in an n vertex complete graph is n(n-1)/2.

Sort the following list using Quick Sort technique, displaying each step. 20, 12, 25 6, 10, 15, 13

13

Consider the binary search tree given below.

Find the result of in-order, pre-order, and

post-order traversals.

Show the deletion of the root node

Insert 11, 22, 33, 44, 55, 66, and 77 in the tree