I need help to write a code in JS that takes 9 numbers and makes a Binary Search Tree then takes a new number that this number must be inserted exactly to the right place so