Say you have some data like –

X1=1, X2=9, X3=2, X4=0, X5=2, X6=1, X7=0, X8=3, X9=1, X10=2, X11=1 . At first add 1 to each data.

i)  Construct a binary search tree (BST) for the given set.

ii)  Show the traversing of the constructed BST (Pre-order, In-order, Post-order)