This worksheet is to help you become familiar with the basics of

Trees

Graphs

Part One

For the following Binary Search Tree show the following paths:

inorder

preorder

postorder

Perform the following operations on the above tree, redrawing the tree after each addition$/$deletion$.$

Add the value $3$

Remove the value $10$

Add the value $10$

Part Two

Given the following adjacency list, draw the undirected graph $.$

For the following Graph fill in the Adjacency Matrix.

$\backslash$table$[[,0,1,2,3,4,5,6,7],[0,,,,,,,,],[1,,,,,,,,],[2,,,,,,,,],[3,,,,,,,,],[4,,,,,,,,],[5,,,,,,,,],[6,,,,,,,,],[7,,,,,,,,]]$