Full Balanced Binary Search Tree Finder

README

In this game, you are trying to construct a full, balanced, binary search tree. Please research binary trees if you are not familiar with this terminology.

You are given a list of nodes that are listed vertically. For each of the nodes, there is an InputField to their right. Enter each of the the nodes' left and right values in the InputField. The nodes are referenced based on 0-based indexing from top to bottom.

This means the first top-most node's index is 0, the second top-most node's index is 1, ... and the last bottom node's index will be (number of nodes-1).

The expected formatting of the Input Field is "left, right".

For example, if a node's left is in index 0 and a node's right is in index 1, enter "0,1" in the InputField next to this node.

Enter a -1 for left or right if the node has an empty left or right respectively.

Finally, there is an InputField at the bottom that prompts the user to enter the root index. This is the index of where the root of the tree should be.

For example, if the root of the tree should be at index 0, enter 0 in this InputField.