Trees

They are the underlying structure of many other data structures

Graph Theory Definition

In Graph Theory we have equivalent definition:

• A connected graph without cycles.
• A connectde graph with a minimal number of edges.
• $|E|=|V|-1$
• A connected acyclcic graph
• Adding any edge to it creates a cycle
• removing any edge disconnects it. All critical edges.

Types of tree data structures:

• Binary Search Trees (BST)