LECTURE 7 - CSC405/SEG405

What determines the shape of a binary search tree (BST)?

In breadth-first search (BFS), how are nodes explored?

Which traversal is typically used to copy a tree?

What happens to a binary search tree when it becomes unbalanced?

Which of the following operations can violate the BST property if not handled correctly?

What is a self-loop in graph theory?

Which algorithm is most effective for detecting cycles in a graph?

What is the correct order of nodes visited during a post-order traversal of a BST?

Which sorting algorithm is inherently based on the structure of binary trees?

Abstraction in data structures refers to:

What is the primary goal of designing an efficient data structure?

Which property must hold true for a binary search tree?

What is the time complexity of searching for a value in a balanced BST?

What distinguishes a weighted graph from an unweighted graph?

In graph theory, parallel edges refer to:

Expression trees are primarily used in:

Which traversal method is most suitable for finding connected components in a graph?

Which of the following best describes an undirected graph?

Which type of tree is used in network routing?

Which shortest path algorithm can handle graphs with negative edge weights?

What does depth-first search (DFS) use to keep track of visited nodes?

What is the primary advantage of using an adjacency list for graph representation?

What is the main limitation of Dijkstra's algorithm?

If a BST has elements {10, 5, 15, 2, 7, 12, 20}, what is the result of an in-order traversal?

Which of the following is true about a directed graph?

The Bellman-Ford algorithm is preferred over Dijkstra's when:

What is the primary use of topological sorting?

Which of the following is NOT a primary benefit of using data structures in programming?

Which data structure is most space-efficient for sparse graphs?

During deletion in a BST, what happens if the node to be deleted has two children?