public static void printNode(Node root)
{
int maxLevel = BinaryTreePrinter.maxLevel(root);
printNodeInternal(new List <Node>()
{
root
}, 1, maxLevel);
}
private static int maxLevel(Node node)
{
if (node == null)
{
return(0);
}
return(Math.Max(BinaryTreePrinter.maxLevel(node.LeftChild), BinaryTreePrinter.maxLevel(node.RightChild)) + 1);
}
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);
}
public void Print()
{
BinaryTreePrinter.printNode(Root);
}
