Data Structures and Algorithms Quiz

Which of the following is a non-linear data structure?

• Array

• Linked List

• Tree

• Stack

In a binary tree, a node with no children is called:

• Root

• Leaf

• Parent

• Sibling

What is the maximum number of children a node can have in a binary tree?

• 1

• 2

• 3

• Any number

A graph with no cycles is called a:

• Directed graph

• Acyclic graph

• Cyclic graph

• Complete graph

Which traversal technique processes the root before its subtrees?

• Inorder

• Preorder

• Postorder

• Level-order

In a graph, what does an edge represent?

• A path between two nodes

• A type of node

• A cycle

• None of the above

The degree of a node in a graph refers to:

• The number of edges connected to it

• Its position in a traversal

• Its value

• The number of neighbors

What is the root of a tree?

• The node at the topmost level

• A leaf node

• A node with no parent

• Both a and c

Which graph traversal uses a queue?

• Depth-First Search

• Breadth-First Search

• Preorder Traversal

• Inorder Traversal

In a binary search tree (BST), the left subtree of a node contains values that are:

• Greater than the node's value

• Equal to the node's value

• Less than the node's value

• None of the above