Can I get the java code for the following question please

Implement a binary tree using the linked structure shown in Chapter Slide 32. 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. Hint: Seer the sample code in P3 as a reference. Trees C 2014 Goodrich, Tamassia, Goldwasser Array-Based Representation of Binary Trees o Nodes are stored in an array X G H 9 10 Node v is stored at X[rank(v)] rank(root)0 if node is th e left child of parent(node), rank(node) = 2 . rank(parent(node)) + 1 C) J if node is the right child of parent (node), rank(node) 2 rank(parent(node)) + 2 2014 Goodrich, Tamassia, Goldwasser Trees