Generate a set of random numbers $,$ try the

maximum$)$ between max and minimum integers $($including negative

values$),$ insert them to a Binary search tree $($BST$).(10$ points$)$ All groups.

Generate random number $(10000,100000,1000000)$ and try to find

these numbers in BST and report their execution times for each dataset.

$(10$ points$).$

r

Use also AVL tree, red$-$black tree for the same things in items $1$ and $2.(10$

points$)$

Delete $(10000,100000)$ random members from the BST and AVL tree,

red$-$black trees. Report their execution times. $(10$ points$).$ Select tree type

from your group definition.

Do the same things for the linked lists that are assigned to your group as

well. $(10$ points$)$ Select linkedlist type from your group definition.

Draw all the plots for the insertion and deletion operations on the same

plot for BST$,$ red$-$black, AVL$-$tree. $(10$ points$)$

Get ready to explain the complexities of the algorithms and other

questions $(40$ points$).$ How do red$-$black trees and AVL trees work.

for RED$-$BLACK tree