Please create a binary search tree and node classes as I have shown in the lecture, including search, insert, delete, and traverse functions, using the following three lists to create the tree and combine the above$-$created function. each step please give output or changed tree plot.

a $=[49,38,65,97,60,76,13,27,5,1]$

b $=[149,38,65,197,60,176,13,217,5,11]$

c $=[49,38,65,97,64,76,13,77,5,1,55,50,24]$