[JAVA] [Binary Tree/Recursion] [Will rate highly]

I need help implementing a binary tree for a program I'm making that uses artificial intelligence in which the computer can never lose to the player in a game of Tic Tac Toe.

Here's a sample of what the output would look like:

^Ignore that last line above (*****extra credit*****)

Here's some specifications for the class I need help creating. It is also important to not that I cannot use any Java API data structures like arraylists and stuff.

Let me know if you need more information about the other classes.

Sample input/output run 1**** Welcome to Tic Tac Toe This is the board: 1 2 3 4 5 6 17 8 9 Please make a move the probability of a win is:0.41 the probability of a draw is:0.20 the probability of a loss is 0.37 Please make a move lol XIX lol LI_l_l the probability of a win is:0.23 the probability of a draw is: 0.25 the probability of a loss is:0.51 Please make a move IXlol lol I l the probability of a win is :0.0 the probability of a draw is:0.0 the probability of a loss is:1.0 The winner is :0 Sample input/output run 1**** Welcome to Tic Tac Toe This is the board: 1 2 3 4 5 6 17 8 9 Please make a move the probability of a win is:0.41 the probability of a draw is:0.20 the probability of a loss is 0.37 Please make a move lol XIX lol LI_l_l the probability of a win is:0.23 the probability of a draw is: 0.25 the probability of a loss is:0.51 Please make a move IXlol lol I l the probability of a win is :0.0 the probability of a draw is:0.0 the probability of a loss is:1.0 The winner is :0