The following nodes are inserted into a tree: $52,76,34,71,62,55,22,58,39,48.$

Create the corresponding:

$$ Binary Search Tree

$$ AVL Tree

For both binary search tree and AVL tree show the final tree after all nodes are

inserted. For the AVL tree, also show the tree before and after each rotation while

highlighting the balance factor of each node, positions x$,$ y and z along with

$($a$,$b$,$c$)$ and $($T$1,$ T$2,$ T$3,$ T$4).$

Discuss your progress with your Tutor during practical sessions.

What to include in your Portfolio:

$$ Report $-$ Activity $2$: Include in your report the resulting binary search tree

and AVL tree. For the AVL tree, show the tree before and after each

rotation while highlighting the balance factor of each node, positions x$,$ y

and z along with $($a$,$b$,$c$)$ and $($T$1,$ T$2,$ T$3,$ T$4)$