JAVA PLS

Design and implement a solution to "draw" a binary tree in the following way. Essentially, we need to assign coordinate x and y to each node v. Then when we print the tree we can use the x, y coordinate to determine the spacing. We can use an in-order traversal and assign coordinate x and y of each node v in the following way: x(v) is the number of nodes visited before v in the in-order traversal of v y(v) is the depth of v 0 1 2 3 4 0 1 2 3 3 4 5 6 7 Design and implement a solution to "draw" a binary tree in the following way. Essentially, we need to assign coordinate x and y to each node v. Then when we print the tree we can use the x, y coordinate to determine the spacing. We can use an in-order traversal and assign coordinate x and y of each node v in the following way: x(v) is the number of nodes visited before v in the in-order traversal of v y(v) is the depth of v 0 1 2 3 4 0 1 2 3 3 4 5 6 7