public static void Main()
int[] arr = {-10,-3,0,5,9};
inorderTraversal( insertElementBBTS(arr,0,arr.Length-1));
public static treeNode insertElementBBTS(int[] arr, int start, int end)
int mid = (start+end) /2;
treeNode n= new treeNode(null,null,arr[mid]);
n.left = insertElementBBTS(arr,start,mid-1);
n.right = insertElementBBTS(arr,mid+1,end);
public static treeNode inorderTraversal(treeNode t)
if (t==null) return null;
inorderTraversal(t.left);
inorderTraversal(t.right);
public treeNode(treeNode r,treeNode l,int val)