Currently working on a program to stimulate a tree made from arrayList of strings consisting of random 0 and 1. Each node has a limit on how many values it can store, and the root is always filled with the first node.size values. And any values after will need to go to a Left or Right child (depending on if it's a value 0 or 1) 0 = left 1 = right. As the tree grows, each level evaluates at the index of the height of the tree. Currently working on a program to stimulate a t