Write a non-recursive method for add and remove for a binary search tree with a complete Java program that can convert a sorted array into a balance binary search tree. The left of the subtree is defined as the number of nodes in the left subtree while the right subtree is defined as the number of nodes in the right one. A binary search tree is balaned if the size of the left and right subtree at each nodes are different by at the very most one.