using System;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        BinaryTreeTest();

    }

    static public void BinaryTreeTest()

        {

            var bTree = new BinarySearchTree();

            var list = new List<int> { 0, 10, 10, 5, 7, 15, 7, 2, 13, 3, 7};

            foreach (var item in list)

            {

                bTree.Add(item);

            }

            bTree.Preorder(bTree.root);

            Console.WriteLine();

            bTree.Levelorder(bTree.root);

            Console.ReadLine();

        }

}

​

class BinarySearchTree 

    {

        public class Node 

        {

            public int data;

            public Node left, right;

            int weight = 0;

​

            public Node (int data)

            {

                this.data = data;

                weight++;

            }

            public void IncraseWeight()

            {

                weight++;

            }

​

            public void AddNode(int data)

            {

                var node = new Node(data);

​

                if (this.data > data)

                {

                    if (left == null) left = node;

                    else left.AddNode(data);

                }

                if (this.data < data)

                {

                    if (right == null) right = node;

                    else right.AddNode(data);

                }

                if (this.data == data) weight++;

            }

        }

​

        public Node root;

        int count;

​

        public BinarySearchTree() { }

​

        public BinarySearchTree(int data)

        {

            root = new Node(data);

            count++;

        }

​

        public void Add(int data)

        {

            if (root == null)

            {

                root = new Node(data);

                count++;

                return;

            }

            root.AddNode(data);

            count++;

        }

        /// <summary>

        /// DFS - прямой обход в глубину 

        /// </summary>

        public void Preorder(Node node)

        {

            if (node == null) return;

            Console.WriteLine(node.data);

            Preorder(node.left);

            Preorder(node.right);

        }

        /// <summary>

        /// BFS - обход в ширину

        /// </summary>

        public void Levelorder(Node node)

        {

            Queue<Node> q = new Queue<Node>();

            q.Enqueue(node);

​

            while(q.Count > 0)

            {

                node = q.Dequeue();

                Console.WriteLine(node.data);

                if (node.left != null) q.Enqueue(node.left);

                if (node.right != null) q.Enqueue(node.right);

            }

        }

    }