Exam 5: Methods

To add a new node, you need to start a process by first placing it as _______ and move it up to maintain the heap property.

A ___________ of a graph is a subgraph that is a tree and connects all vertices in the graph.

Find all shortest paths starting from vertex A in the following graph.

The ________ is to visit the left subtree of the current node first, then the current node itself, and finally the right subtree of the current node.

Show the inorder, preorder, and postorder of the following BST.

If two vertices are connected by two or more edges, these edges are called ______.

The time complexity of the DFS algorithm is

Draw a DFS tree from the following graph starting from vertex E.

Show the BST after inserting 45, 43, 100, 34, 23, and 3 into an empty BST.

Show the BST after deleting 60 from the following BST.

The time complexity for finding an element in a binary search tree is _________.

Draw a BFS tree from the following graph starting from vertex E.

A _________ is the one in which every two pairs of vertices are connected.

Find a MST in the following graph.

A graph may have several minimum spanning tree.

A ____ is an edge that links a vertex to itself.

Show the BST after deleting 15 from the following BST.