1. Which undirected graph representation is most appropriate for determining quickly whether a...

1. Which undirected graph representation is most appropriate for determining quickly whether a vertex is isolated (is connected to no other vertices)?

2. Suppose depth-first search is used on a binary search tree and the right edge taken before the left out of each node. In what order are the nodes visited?