True or false: the elements along the diagonal of an adjacency matrix representation of a graph correspond to self-edges, i.e. edges of the form (a,a) where a Is a node in the graph.

If every node in a binary tree has two children except the leaf (terminal) nodes, and the longest path in the graph from the root to a leaf has 3 edges, can there be 7 nodes in the graph?

A binary tree with n nodes were every leaf node is exactly the same distance from the root, has how many nodes?

True or false, A graph without a spanning tree is not a connected graph

True or false, depth-first search involves backtracking