KS5 - Understanding Binary Trees

What data structure is focused on in the video?

• Linked List

• Queue

• Binary Tree

• Stack

What is the first step in adding an item to a binary tree?

• Create a new node

• Check if the tree is empty

• Start at the root node

• Check for free memory for a new node

What happens if the binary tree is empty when adding a new item?

• The new node becomes the root node

• The item is discarded

• An error is reported

• The process is restarted

How can you achieve adding, removing, and traversing in a binary tree?

• Using a stack

• Using recursion only

• Using a queue

• Using an array or an object-oriented technique

What is recommended by the exam board regarding methods for binary trees?

• Memorizing code patterns

• Focusing on one method only

• Understanding methods theoretically

• Gaining practical experience

What is a special case when adding an item to a binary tree?

• Adding an item larger than all others

• The tree being empty

• The tree being full

• Adding a duplicate item

What is the Hibbard deletion algorithm used for?

• Balancing the binary tree

• Deleting a node with two children

• Finding the smallest value in the right subtree

• Deleting the root node

What traversal method is used to create a copy of a binary tree?

• In-order traversal

• Pre-order traversal

• Post-order traversal

• Level-order traversal

Which traversal method outputs the contents of a binary tree in order?

• Post-order

• Breadth-first

• In-order

• Pre-order

What is the result of deleting a leaf node from a binary tree?

• A new leaf node is added

• The tree becomes unbalanced

• The parent's pointer to the node is set to null

• The tree is restructured