Deck 5: Methods

Question 1

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) the last node in the heap
B) the new root
C) the right child of the root
D) the left child of the root

Answer 1

A

Question 2

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

Answer 2

Question 3

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

A) complete graph
B) weighted graph
C) directed graph

Answer 3

A

Question 4

Show the BST after deleting 15 from the following BST.

Question 5

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

Question 6

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

Question 7

Show the BST after deleting 60 from the following BST.

Question 8

The time complexity of the DFS algorithm is

A) true
B) false

Question 9

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

Question 10

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

A) spanning tree
B) shorted path

Question 11

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

A) loop
B) parallel edge
C) weighted edge
D) directed edge

Question 12

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

A) loop
B) parallel edge
C) weighted edge
D) directed edge

Question 13

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

Question 14

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

A) O(logn)
B) O(nlogn)
C) O(n)
D) O(1)

Question 15

A graph may have several minimum spanning tree.

A) true
B) false

Question 16

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

Question 17

Find a MST in the following graph.