A - Level Tree Traversal

What is the Big O Notation of Merge Sort?

• O(n)

• O (n log n)

• O(log n)

• O(n²)

Does Breadth-first search use a queue or a stack?

• Stack

• Queue

• Both

• neither

Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

• Pre-Order

• In-Order

• Post-Order

• Monastic Orders

A list must be in order for a Binary search to take place

• True

• False

displays data items in a hierarchical view

• Flowchart
• Trees
• Binary Tree
• Binary Expression Tree

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

Choose the correct statement

• A data structure is a specialised format for organising and storing data

• A data structure is a specialised format for organising and storing information

• A data structure is a format for organising and storing only one data type

• A data structure is too complicated to truly understand or use

A Balanced Tree has equal number of items on each subtree.

• True
• False

Root has more left descendants than the right descendants or vice versa.

• Balanced Tree
• Perfect Tree
• Right Tree
• Unbalanced Tree