FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 5: Methods

Show Answer

Share

---

All types

Filters

Study Flashcards

Question 1

Short Answer

Review LaterAdd Note

Review Later

Show the BST after deleting 60 from the following BST.

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

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.

A) postorder traversal
B) preorder traversal
C) inorder traversal
D) breadth-first traversal

E) B) and C)
F) A) and C)

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

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 ____ is an edge that links a vertex to itself.

Find a MST in the following graph.

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

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

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

A graph may have several minimum spanning tree.

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

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

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

Show the BST after deleting 15 from the following BST.

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

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

The time complexity of the DFS algorithm is

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