Discrete Structure: Trees

What is a tree in graph theory?

• A disconnected graph with no edges

• A graph with multiple loops

• A connected graph with no simple circuits

• A connected graph with simple circuits

What is a binary search tree?

• A tree with only one child per node

• A tree with nodes sorted according to their key values

• A tree where the left child is lesser than the parent

• A tree where the left child is greater than the parent

Which traversal method visits the root node first?

• Inorder Traversal

• Postorder Traversal

• Preorder Traversal

• Level Order Traversal

In a binary tree, how many children can a node have?

• Any number

• Three

• Two

• One

What is the result of an inorder traversal of a binary search tree?

• Unsorted key values

• Sorted key values in ascending order

• Sorted key values in descending order

• Random key values

What does a spanning tree contain?

• All vertices of a graph with maximum edges

• All vertices of a graph with minimum edges

• Only the root node of a graph

• All edges of a graph

Which of the following is NOT a method of tree traversal?

• Random Order Traversal

• Inorder Traversal

• Preorder Traversal

• Postorder Traversal

What is the key property of a binary search tree?

• All nodes have two children

• Left child is greater than parent

• Left child is lesser than parent

• Right child is lesser than parent

What is the first step in the Depth-First Search algorithm for building a spanning tree?

• Randomly choose a vertex as the root

• Add all edges to the tree

• Remove edges to eliminate cycles

• Visit all children of the root

In postfix notation, where are operators placed?

• After their operands

• Between their operands

• At the beginning of the expression

• Before their operands