Can I get the Java code for the following problem please

10. Implement a binary tree using the array-based representation shown in Chapter Slide 33. Code in Java with main class. Use the binary tree in Slide 33 as an input instance. Attach your code and screenshot of the output. See next page for example code (details of some methods are missing.) JAVA implementation of tree using array numbering starting from O to n-1. mport java mport javaiana dass Tree ( public staftic void main Shing ars) rcode above is an example ct an ntance. You need to not the rec shown in sia Poneate roor public void BootSaring key) Pcreale left son of roori create right son of roori English (United States) Normal No Spacing Heading 1 Heading 2 Title Sub class Aray..imp( static it root 0 static Strinal str-new Stringl10: create root' public vold Bool(String key) create left son of root public void set.Leti String kery, jct root) need your code here Staten-outanott("Cant set child at %d, no parent toundoen: stdu key create right son of root public void setBightSring key, iot root) 'need your code here" sdroot sustenotoiatrcan't set chid at %d, no parent brdoen public vold proint Tonso eise