Question

1.) Consider the binary search tree create by inserting the following values in the ordered given to create the binary search tree [20, 15, 45, 13, 25], what is the order that the nodes will be accessed using the inorder traversal.

	a.	20, 15, 45, 13, 25
	b.	13, 15, 25, 45, 20
	c.	13, 15, 20, 25, 45
	d.	None of the above.

2.) What C++ operation is used to de-allocate memory space?

	a.	deallocate
	b.	new
	c.	delete
	d.	None of the above

3.) Consider the following description of a directed graph:

Set of Vertices = {0, 1, 2, 3}

Set of Edges = {(0, 1), (1, 3), (3, 2), (2, 0)}

What is true about this graph?

	a.	The graph is weakly connected.
	b.	The graph is strongly connected.
	c.	Both a and b
	d.	None of the above.

Answer 1