public void DumpBinaryTree()
        {
            const string filePath = @"../../BinaryTree.txt";
            StreamWriter writter = new StreamWriter(filePath);
            using (writter)
            {
                RecursiveWrite(writter);
            }

        }


        public void RecursiveWrite(StreamWriter writter, Node<T> node)
        {
            if (node == null)
            {
                writter.Write("-1 ");
                return;
            }

            string data = node.Value.ToString();
            int charsData = data.Length;
            writter.Write(charsData + " " + data + " ");

            for (int i = 0; i < node.ChildrenCount; i++)
            {
                RecursiveWrite(writter, node.Children[i]);
            }

            for (int i = node.ChildrenCount; i < 2; i++)
            {
                RecursiveWrite(writter, null);
            }
        }


        public void RecursiveWrite(StreamWriter writter)
        {
            RecursiveWrite(writter, this.root);
        }

        public Tree<string> LoadBinaryTree()
        {
            const string filePath = @"../../BinaryTree.txt";
            StreamReader reader = new StreamReader(filePath);
            Tree<string> newTree = null;

            using (reader)
            {
                string line = reader.ReadLine();
                string[] treeParts = line.Split();

                int now = 0;
                newTree = MakeTree(treeParts,ref now);
            }
            return newTree;
        }

        private Tree<string> MakeTree(string[] treeParts,ref int now)
        {
            if (treeParts[now] == "-1")
            {

                return null;
            }

            now++;
            Tree<string> tree = new Tree<string>(treeParts[now]);

            now++;
            Tree<string> leftSubtree = MakeTree(treeParts, ref now);

            now++;
            Tree<string> rightSubtree = MakeTree(treeParts, ref now);

            if (leftSubtree != null)
            {
                tree.root.AddChild(leftSubtree.root);
            }
            if (rightSubtree != null)
            {
                tree.root.AddChild(rightSubtree.root);
            }

            return tree;
        }