Insert the following integers into a Binary Search Tree, in the following order: 7,3,4,6,9,1,8 Fill in the following blanks with integers separated by commas, with no spaces between. An In-order Traversal of this tree would be: A Pre-order Traversal of this tree would be: A Post-order Traversal of this tree would be: A Level-order Traversal of this tree would be: Enter integers separated by commas, with no spaces between