DATA STRUCTURE

please i need this very fast i have 10 minutess give me anything

2.1 Draw the binary search tree that is created if the following numbers are inserted in the tree in the given order: 11,7,9,8,10,14,3,5 2.3 Create a full binary searcull hence one of the no only has one child ary search tree containing the same nodes (numbers) given in part (2.1). 2.4 For the tree created in part (2.1), list the nodes in a post-order traversal. 2.5 For the tree created in part (2.1), list the nodes in an in-order traversal. 3 etween 2.6 Show the tree after deleting the node 10