Write a recursive buildBinaryTree method that builds a new binary tree from the contents of an array that contains integers. Use the following class definition for a node in a binary tree: class BinaryNode { int element; BinaryNode left; BinaryNode right; } Hint: Take one item from the array and insert it as the root of the tree. Divide the remaining items in half and insert one half in the right subtree and the other half in the left subtree of the root node by calling the method recursively with the relevant array indices.Write a method oddEntries that returns the number of odd integers contained in a binary tree where the element type is int. This method is called with a link to the root node of the tree. import test.BinaryNode;// BinaryNode class; stores a node in atree.//// CONSTRUCTION: with (a) no parameters,or (b) an 0bject,//or (c) an Object, left child, andright child.//// ********PUBLICOPERATIONS***// int size( )of subtree at node// int height( )height of subtree at node// void printPostOrder( )postorder tree traversal// void printInorder( )inorder tree traversalt*****-- Return size-- Return-- Print a-- Print an// void printPreOrder( )preorder tree traversal// BinaryNode duplicate( )-- Return aduplicate tree-- Print a/*** Binary node class with recursiveroutines tocompute size and height.*/class BinaryNode{public BinaryNode( ){this( 0, null, null );}public BinaryNode( int theElement,BinaryNode lt, BinaryNode rt ){elementtheElement;lt;= rt;%3Dleft%3Dright}%3D/*** Return the size of the binary treerooted at t.치/public static int size( BinaryNode t){if( t ==return 0;null )elsereturn 1 + size( t.left ) +size( t.right );}/*** Return the height from a node tothe root node of the binary tree.* /public static int height( /** CODEHERE **/ ){/** CODE HERE **/}// Print tree rooted at current nodeusing preorder traversal.public void printPreOrder( ){System.out.println( element );// Nodeif( left != null )left.printPreOrder( );// Leftif( right != null )right.printPreOrder( );// Right|}// Print tree rooted at current nodeusing postorder traversal.public void printPostorder( ){if( left != null )left.printPostorder( );// Leftif( right != null )right.printPostOrder( );// Right|System.out.println( element );// Node}// Print tree rooted at current nodeusing inorder traversal.public void printInorder (O{if( left != null )left.printInOrder( );// LeftSystem.out.println( element );// Nodeif( right != null )right.printInOrder( );// Right|}/*** Return a reference to a node thatis the root of a* duplicate of the binary tree rootedat the current node.*/public BinaryNode duplicate( ){BinaryNode root =element, null, null );new BinaryNode(if( left != null )If there's a left subtree//root.left = left.duplicate( );%3D// Duplicate; attachif( right != null )there's a right subtree// Ifroot.right = right.duplicate(// Duplicate; attachreturn root;);// Return resulting tree}public int getElement( ){return element;}public BinaryNode getLeft( ){return left;}public BinaryNode getRight(O{return right;}publicvoid setElement( int x ){element = x;}public void setleft( BinaryNode t ){leftt;%3D}public void setRight( BinaryNode t ){right}= t;private intprivate BinaryNode left;private BinaryNode right;}element;

Question

Write a recursive buildBinaryTree method that builds a new binary tree from the contents of an array that contains integers. Use the following class definition for a node in a binary tree: class BinaryNode { int element; BinaryNode left; BinaryNode right; } Hint: Take one item from the array and insert it as the root of the tree. Divide the remaining items in half and insert one half in the right subtree and the other half in the left subtree of the root node by calling the method recursively with the relevant array indices.Write a method oddEntries that returns the number of odd integers contained in a binary tree where the element type is int. This method is called with a link to the root node of the tree. import test.BinaryNode;// BinaryNode class; stores a node in atree.//// CONSTRUCTION: with (a) no parameters,or (b) an 0bject,//or (c) an Object, left child, andright child.//// ********PUBLICOPERATIONS***// int size( )of subtree at node// int height( )height of subtree at node// void printPostOrder( )postorder tree traversal// void printInorder( )inorder tree traversalt*****--> Return size--> Return--> Print a--> Print an// void printPreOrder( )preorder tree traversal// BinaryNode duplicate( )--> Return aduplicate tree--> Print a/*** Binary node class with recursiveroutines tocompute size and height.*/class BinaryNode{public BinaryNode( ){this( 0, null, null );}public BinaryNode( int theElement,BinaryNode lt, BinaryNode rt ){elementtheElement;lt;= rt;%3Dleft%3Dright}%3D/*** Return the size of the binary treerooted at t.치/public static int size( BinaryNode t){if( t ==return 0;null )elsereturn 1 + size( t.left ) +size( t.right );}/*** Return the height from a node tothe root node of the binary tree.* /public static int height( /** CODEHERE **/ ){/** CODE HERE **/}// Print tree rooted at current nodeusing preorder traversal.public void printPreOrder( ){System.out.println( element );// Nodeif( left != null )left.printPreOrder( );// Leftif( right != null )right.printPreOrder( );// Right|}// Print tree rooted at current nodeusing postorder traversal.public void printPostorder( ){if( left != null )left.printPostorder( );// Leftif( right != null )right.printPostOrder( );// Right|System.out.println( element );// Node}// Print tree rooted at current nodeusing inorder traversal.public void printInorder (O{if( left != null )left.printInOrder( );// LeftSystem.out.println( element );// Nodeif( right != null )right.printInOrder( );// Right|}/*** Return a reference to a node thatis the root of a* duplicate of the binary tree rootedat the current node.*/public BinaryNode duplicate( ){BinaryNode root =element, null, null );new BinaryNode(if( left != null )If there's a left subtree//root.left = left.duplicate( );%3D// Duplicate; attachif( right != null )there's a right subtree// Ifroot.right = right.duplicate(// Duplicate; attachreturn root;);// Return resulting tree}public int getElement( ){return element;}public BinaryNode getLeft( ){return left;}public BinaryNode getRight(O{return right;}publicvoid setElement( int x ){element = x;}public void setleft( BinaryNode t ){leftt;%3D}public void setRight( BinaryNode t ){right}= t;private intprivate BinaryNode left;private BinaryNode right;}element;

Accepted Answer

According to the given data in the question :
 
Write a recursive buildBinaryTree method that builds…