Binary Search Trees

Question 1

What is a binary search tree?

Answer 1

A Binary Search Tree is a binary tree where the items are stored
in a way that makes it easy to find them

A binary search tree is a binary tree where for every node, if it
is not a leaf node,
 all the descendents in its left sub-tree have smaller values
than it and
 all the descendents in its right sub-tree have larger values
than it.

Question 2

Name the four cases for removal

Answer 2

The node to be deleted is not in the tree.

The node to be deleted is a leaf node.

The node to be deleted has one child.

The node to be deleted has two children

Question 3

What is a perfect binary search tree?

Answer 3

When the height of the tree is the smallest possible.