Data Structures Quiz No 2

Which type of traversal of binary search tree outputs the value in sorted order?

• Pre-order

• Post-order

• In-Order

• None

Which of the following sequences denotes the post order traversal sequence of the tree?

• f e g c d b a

• g c b d a f e

• g c d b f e a

• f e d g c b a

In a tree data structure, any nodes that have no children (where the tree ends) are called ___

• boundary nodes

• leaf nodes

• orphan nodes

• terminal nodes

Which data structure is used for data that links arbitrarily, and includes things like loops?

• binary trees

• circular trees

• graphs

• dynamic linked stacks

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

What is the value of the ROOT node in this Tree?

• 35

• 24

• 42

• 20

Root

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• the starting node in a rooted tree structure from which all other nodes branch off./

Tree

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• the starting node in a rooted tree structure from which all other nodes branch off./

How many leaf are there in the tree?

• 1

• 3

• 4

• 7