A-level binary tree algorithms

What is the primary function of a binary tree?

• To allow for efficient searching and sorting.
• To store data in a linear format.
• To facilitate direct access to elements.
• To manage memory allocation.

What should you check before adding a node to a binary tree?

• If the node is already present.
• If there is free memory.
• If the tree is balanced.
• If the tree is a complete binary tree.

What is the primary purpose of creating a new node when adding an item to a binary tree?

• To maintain the tree's balance.
• To insert data into it.
• To replace an existing node.
• To flag a node as deleted.

What happens to a new node if the binary tree is empty?

• It is discarded.
• It becomes a leaf node.
• It becomes the root node.
• It is added as a child of the root.

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

• Create a new node.
• Find the correct position for the new node.
• Set the previous node's pointer.
• Check if the tree is empty.

What happens when you follow the left pointer while adding a node?

• You are looking for a position for a larger value.
• You are deleting a node.
• You are checking for a duplicate value.
• You are finding a position for a smaller value.

What is the first step in removing a node from a binary tree?

• Find the node to delete.
• Set the previous node's pointer to null.
• Flag the node as deleted.
• Check if the node has children.

What is the first step when deleting a node that has two children in a binary tree?

• Flag the node as deleted.
• Find the smallest value in the right subtree.
• Replace it with its child.
• Set the previous node's pointer to null.

What should you consider when deleting a node from a binary tree?

• The node must have at least one child.
• The node must be the root of the tree.
• The node can have at most two children.
• The node can only be a leaf.

Which of the following statements about binary tree deletion is true?

• There are three scenarios to consider when deleting a node.
• Deletion does not affect the tree structure.
• You must always delete the root first.
• You can only delete leaf nodes.