Having problem with drawing the BST.

could anyone help me out from this??????? I drew some similar question before and got wrong.

How could we draw a BST tree like this??

Draw the binary search tree whose elements are inserted in the following order: 6 30 12 23 1 9 7 10 Is the resulting tree a full tree, a complete tree, a perfect tree, an AVL tree? Explain why or why not.