コード例 #1
0
        private static int MaxLevel(Node node)
        {
            if (node == null)
            {
                return(0);
            }

            return(Math.Max(BinaryTreePrinter.MaxLevel(node.LeftChild), BinaryTreePrinter.MaxLevel(node.RightChild)) + 1);
        }
コード例 #2
0
        public static void PrintNode(Node root)
        {
            int maxLevel = BinaryTreePrinter.MaxLevel(root);

            PrintNodeInternal(new List <Node>()
            {
                root
            }, 1, maxLevel);
        }
コード例 #3
0
 public void Print()
 {
     BinaryTreePrinter.PrintNode(Root);
 }
コード例 #4
0
        private static void PrintNodeInternal(List <Node> nodes, int level, int maxLevel)
        {
            if (nodes.Count == 0 || BinaryTreePrinter.IsAllElementsNull(nodes))
            {
                return;
            }

            int floor         = maxLevel - level;
            int endgeLines    = (int)Math.Pow(2, (Math.Max(floor - 1, 0)));
            int firstSpaces   = (int)Math.Pow(2, (floor)) - 1;
            int betweenSpaces = (int)Math.Pow(2, (floor + 1)) - 1;

            BinaryTreePrinter.PrintWhitespaces(firstSpaces);

            List <Node> newNodes = new List <Node>();

            foreach (var node in nodes)
            {
                if (node != null)
                {
                    Console.Write(node.Value);
                    newNodes.Add(node.LeftChild);
                    newNodes.Add(node.RightChild);
                }
                else
                {
                    newNodes.Add(null);
                    newNodes.Add(null);
                    Console.Write(" ");
                }

                BinaryTreePrinter.PrintWhitespaces(betweenSpaces);
            }
            Console.WriteLine("");

            for (int i = 1; i <= endgeLines; i++)
            {
                for (int j = 0; j < nodes.Count; j++)
                {
                    BinaryTreePrinter.PrintWhitespaces(firstSpaces - i);
                    if (nodes[j] == null)
                    {
                        BinaryTreePrinter.PrintWhitespaces(endgeLines + endgeLines + i + 1);
                        continue;
                    }

                    if (nodes[j].LeftChild != null)
                    {
                        Console.Write("/");
                    }
                    else
                    {
                        BinaryTreePrinter.PrintWhitespaces(1);
                    }

                    BinaryTreePrinter.PrintWhitespaces(i + i - 1);

                    if (nodes[j].RightChild != null)
                    {
                        Console.Write("\\");
                    }
                    else
                    {
                        BinaryTreePrinter.PrintWhitespaces(1);
                    }

                    BinaryTreePrinter.PrintWhitespaces(endgeLines + endgeLines - i);
                }

                Console.WriteLine("");
            }

            PrintNodeInternal(newNodes, level + 1, maxLevel);
        }