group3

Question 1

What is traversing in data structures?

Answer 1

The process of visiting each node in a data structure exactly once.

Question 2

True or False: Traversing is only applicable to tree data structures.

Answer 2

False

Question 3

Fill in the blank: The two primary methods of traversing trees are __________ and __________.

Answer 3

pre-order, post-order

Question 4

What is the time complexity of traversing a linked list?

Answer 4

O(n)

Question 5

Which traversal method visits the root node first?

Answer 5

Pre-order traversal

Question 6

In which order does in-order traversal visit nodes in a binary tree?

Answer 6

Left child, root, right child

Question 7

What is the main difference between depth-first and breadth-first traversal?

Answer 7

Depth-first explores as far down a branch as possible before backtracking, while breadth-first explores all neighbors at the present depth prior to moving on to nodes at the next depth level.

Question 8

True or False: Breadth-first traversal uses a stack data structure.

Answer 8

False

Question 9

What data structure is commonly used for breadth-first traversal?

Answer 9

Queue

Question 10

What is the traversal order for a post-order traversal in a binary tree?

Answer 10

Left child, right child, root

Question 11

Fill in the blank: In a binary search tree, in-order traversal results in __________ order of the elements.

Answer 11

sorted

Question 12

What is a common application of tree traversal?

Answer 12

Searching for a specific value or performing operations in a hierarchical structure.

Question 13

Which traversal method is best for evaluating expression trees?

Answer 13

Post-order traversal

Question 14

True or False: Traversing a graph can be done using only depth-first search.

Answer 14

False

Question 15

What are the two main algorithms used for graph traversal?

Answer 15

Depth-first search (DFS) and breadth-first search (BFS)

Question 16

In graph traversal, what does a visited node signify?

Answer 16

A node that has already been explored to prevent cycles.

Question 17

What is the time complexity of breadth-first search in a graph?

Answer 17

O(V + E), where V is vertices and E is edges.

Question 18

Fill in the blank: In a binary tree, the maximum number of nodes at level ‘l’ is __________.

Answer 18

2^l

Question 19

True or False: All binary trees are binary search trees.

Answer 19

False

Question 20

What is level-order traversal?

Answer 20

A traversal method that visits nodes level by level from top to bottom.

Question 21

Which traversal method is typically implemented using recursion?

Answer 21

Depth-first traversal

Question 22

What is the primary data structure used in depth-first traversal?

Answer 22

Stack

Question 23

Fill in the blank: The __________ traversal method is used to process all nodes at the current depth before moving to the next level.

Answer 23

breadth-first

Question 24

What is the purpose of a traversal algorithm?

Answer 24

To systematically visit and process each node in a data structure.

Question 25

True or False: A depth-first search can be implemented iteratively using a stack.

Answer 25

True

Question 26

What is the characteristic of a complete binary tree?

Answer 26

All levels are fully filled except possibly for the last level, which is filled from left to right.

Question 27

What does the term 'backtracking' refer to in depth-first traversal?

Answer 27

Returning to the previous node after reaching a dead end.

Question 28

Fill in the blank: In a graph, if there are no edges, the traversal will only visit __________.

Answer 28

the starting node

Question 29

What is a spanning tree in graph theory?

Answer 29

A subgraph that includes all the vertices and is a tree.

Question 30

True or False: Traversing a cyclic graph can lead to infinite loops if not managed correctly.

Answer 30

True

Question 31

What is the role of a 'visited' array in graph traversal?

Answer 31

To keep track of which nodes have already been explored.

Question 32

What is a key advantage of breadth-first traversal?

Answer 32

It finds the shortest path in unweighted graphs.

Question 33

Fill in the blank: The __________ property of a binary search tree allows for efficient searching.

Answer 33

ordering

Question 34

What is the main disadvantage of depth-first search?

Answer 34

It may get trapped in deep paths and miss shorter solutions.

Question 35

What type of traversal is used in topological sorting?

Answer 35

Depth-first search

Question 36

True or False: A binary tree can have at most two children per node.

Answer 36

True

Question 37

What is a leaf node?

Answer 37

A node that has no children.

Question 38

What does it mean for a tree to be balanced?

Answer 38

The height of the left and right subtrees of any node differ by at most one.

Question 39

Fill in the blank: In a binary tree, the __________ node is the topmost node.

Answer 39

root

Question 40

What is a full binary tree?

Answer 40

A binary tree in which every node other than the leaves has two children.

Question 41

True or False: Depth-first search can be used for solving puzzles.

Answer 41

True

Question 42

What is the primary use of a priority queue in graph traversal?

Answer 42

To select the next vertex to explore based on priority.

Question 43

Fill in the blank: The __________ traversal method is often used in algorithms like Dijkstra's and Prim's.

Answer 43

greedy

Question 44

What is the main objective of traversing a data structure?

Answer 44

To access and manipulate the data contained within it.

Question 45

What traversal method would you use to create a copy of a binary tree?

Answer 45

Any traversal method (pre-order, in-order, post-order)

Question 46

True or False: Traversing a data structure can help in finding the minimum or maximum value.

Answer 46

True

Question 47

What does a depth-first traversal of a binary tree generally require in terms of space?

Answer 47

O(h), where h is the height of the tree.

Question 48

Fill in the blank: In a binary tree, the __________ of a node refers to the number of edges from the node to the tree's root.

Answer 48

depth

Question 49

What is the primary disadvantage of breadth-first search?

Answer 49

It requires more memory than depth-first search.

Question 50

True or False: Traversing a data structure modifies its structure.

Answer 50

False

Question 51

What is a directed graph?

Answer 51

A graph where edges have a direction, indicating a one-way relationship.

Question 52

Fill in the blank: A __________ graph has edges that are bidirectional.

Answer 52

undirected

Question 53

What is a weighted graph?

Answer 53

A graph where edges have associated weights or costs.

Question 54

True or False: All graph traversals can be applied to both directed and undirected graphs.

Answer 54

True

Question 55

What is the main purpose of a traversal algorithm in a tree structure?

Answer 55

To process each node in a specific order.