Quiz 3 Trees for Ostim DSA

Write your Name and Student Id.

A tree is a non-linear and hierarchal data structure

• True

• False

In a tree, the topmost node is called the parent node.

• True

• False

Which one is NOT a tree terminology?

• Root

• Edge

• Degree

• Index

Which one is a characteristics of tree?

• B-Tree and B+ Tree are used to implement indexing in databases

• A tree is also known as a recursive data structure

• tree data structure helps in Game Development.

• All choices are true

Which one is true for Formal Tree Definition?

• Two nodes that are children of the same parent are siblings

• A node v is external if v has no children

• A node v is internal if it has one or more children

• External nodes are also known as leaves

• All choices are true.

Which one is NOT a Tree Traversal Algorithms?

• Breadth-First

• Pre-Order

• Post-Order

• Last-Order

What is the result according to Breadth-First Tree Traversal?

• A C D P Z I M K

• A C P D Z M I K

• P C A M Z K I D

• M K P Z I C D A

What is the result according to the In-Order Tree Traversal Algorithm?

• P C A M Z D I K

• A C P D Z M I K

• P C M Z K I D A

• A C D P Z I M K

Which one is can be said for a binary search tree?

• Every node in the tree can have at most 2 children (left child and right child)

• Left child is greater than the parent node

• Right child is smaller than the parent node

• every node can have more than two children.