Trees

Question 1

What is a tree?

Answer 1

A graph that has no cycles (not possible to loop back around to a previous part of the tree) and is not disconnected

Question 2

What is a rooted tree?

Answer 2

A tree with a rooted node from which all edges leading away from that root

Question 3

What is a binary tree?

Answer 3

A tree that each node has a maximum of two children

Question 4

What are the advantages of using a binary search tree to store data

Answer 4

Values are stored in the tree in order, no matter what order the values are added
The values don’t need to be re-sorted each time a new
value is added
A binary search can be performed easily without needing to sort the values