public Node insert(Node root, long v)
root.left = insert(root.left, v);
root.right = insert(root.right, v);
public void preOrder(Node root)
if (root == null) return;
Console.Write(root.data+" ");
public void inOrder(Node root)
if (root == null) return;
Console.Write(root.data+" ");
public void postOrder(Node root)
if (root == null) return;
Console.Write(root.data+" ");
public class BinarySearchTree
public static void Main(string[] args)
string[] s = Console.ReadLine().Split();
root = bst.insert(root, a);
bst.preOrder(root); Console.WriteLine();
bst.inOrder(root); Console.WriteLine();
bst.postOrder(root); Console.WriteLine();