Group 2 - Trees

What are the 4 common operation in binary search tree?

• SEARCH

• INSERTION

• DELETION

• TRAVERSAL

• PEEK

What are the different traversal types? Select all the correct answers.

• Breadth-First or Level Order

• Inorder

• Postorder

• Depth-First

• Preorder

Answer explanation

The Inorder, Preorder, and Postorder are under Depth First.

Type of search that repeatedly partitions all the elements to find a certain element.

• Binary Search Tree

• Binary Tree

An (a)   is a data structure in which the data is placed in a linear way.

In binary search tree, what is the formula for getting the middle of the list?

• middle = (left + right) / 2

• middle = left + right / 2

• middle = left + (right / 2)

• middle = (left - right) / 2

The procedure of visiting all the nodes in a specific order.

• Trees Tranversal

• Binary Search Tree

• Tree Traversal

• Tree Transvesal

IS THIS A TREE DATA STURCTURE?

• YES

• NO

Answer explanation

REMEMBER: NODES THAT ARE ALLIGNED OR ON THE SAME LEVEL CANNOT CONNECT.

What do you call this node? The element F.

(a)  

Answer explanation

REMEMBER:

LEAF NODE (external node) - has no child nodes

Which of these is an example of a binary tree?

• 
• 
• 
• 

BONUS QUESTION!
SINO ANG PINAKA-POGI SA MEETING NOW?