A function to do inorder traversal of BST
void inorderRec ( Node root ) { if ( root != null ) { inorderRec ( root . left ) ; Console . Write ( root . key + " ▁ " ) ; inorderRec ( root . right ) ; } } void treeins ( int [ ] arr ) { for ( int i = 0 ; i < arr . Length ; i ++ ) { insert ( arr [ i ] ) ; } }