using System;

​

public class Node

{

    public long data;

    public Node left;

    public Node right;

}

​

public class Tree

{

    public Node insert(Node root, long v)

    {

        if (root == null)

        {

            root = new Node();

            root.data = v;

        }

        else if (v < root.data)

            root.left = insert(root.left, v);         

        else

            root.right = insert(root.right, v);

        return root;

    }

​

    public void preOrder(Node root)

    {

        if (root == null) return; 

        Console.Write(root.data+" ");

        preOrder(root.left);

        preOrder(root.right);

    }

    public void inOrder(Node root)

    {

        if (root == null) return; 

        inOrder(root.left);

        Console.Write(root.data+" ");

        inOrder(root.right);

    }

    public void postOrder(Node root)

    {

        if (root == null) return; 

        postOrder(root.left);

        postOrder(root.right);

        Console.Write(root.data+" ");

    }

}

​

​

public class BinarySearchTree

{

    public static void Main(string[] args)

    {

        Node root = null;

        Tree bst = new Tree();

        string[] s = Console.ReadLine().Split();

        long a, i, l = s.Length;

        for(i=0; i<l ;i++)

        {

            a = long.Parse(s[i]);

            root = bst.insert(root, a);

        }

        bst.preOrder(root); Console.WriteLine();

        bst.inOrder(root);  Console.WriteLine();

        bst.postOrder(root);    Console.WriteLine();

        // 1 2 7 3 10 5 8

    }

}

​