Binary Tree Search with root and an array of children[value, left, right] and finally a travers in inorder recursively
I would like to compute math sqrt with eps 0.0001 and a relation of recurrence an+1 = an + n/an all under two