Created
November 26, 2018 13:48
-
-
Save tuesd4y/8d19f1f250d49a14b412c9a6d4a3170a to your computer and use it in GitHub Desktop.
asdfasdf
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.ArrayList; | |
import java.util.Collections; | |
import java.util.List; | |
class BTreePrinter { | |
public static void printNode(AVLNode root) { | |
int maxLevel = BTreePrinter.maxLevel(root); | |
printNodeInternal(Collections.singletonList(root), 1, maxLevel); | |
} | |
private static void printNodeInternal(List<AVLNode> nodes, int level, int maxLevel) { | |
if (nodes.isEmpty() || BTreePrinter.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; | |
BTreePrinter.printWhitespaces(firstSpaces); | |
List<AVLNode> newNodes = new ArrayList<>(); | |
for (AVLNode node : nodes) { | |
if (node != null) { | |
System.out.print(node.elem); | |
newNodes.add(node.left); | |
newNodes.add(node.right); | |
} else { | |
newNodes.add(null); | |
newNodes.add(null); | |
System.out.print(" "); | |
} | |
BTreePrinter.printWhitespaces(betweenSpaces); | |
} | |
System.out.println(""); | |
for (int i = 1; i <= endgeLines; i++) { | |
for (int j = 0; j < nodes.size(); j++) { | |
BTreePrinter.printWhitespaces(firstSpaces - i); | |
if (nodes.get(j) == null) { | |
BTreePrinter.printWhitespaces(endgeLines + endgeLines + i + 1); | |
continue; | |
} | |
if (nodes.get(j).left != null) | |
System.out.print("/"); | |
else | |
BTreePrinter.printWhitespaces(1); | |
BTreePrinter.printWhitespaces(i + i - 1); | |
if (nodes.get(j).right != null) | |
System.out.print("\\"); | |
else | |
BTreePrinter.printWhitespaces(1); | |
BTreePrinter.printWhitespaces(endgeLines + endgeLines - i); | |
} | |
System.out.println(""); | |
} | |
printNodeInternal(newNodes, level + 1, maxLevel); | |
} | |
private static void printWhitespaces(int count) { | |
for (int i = 0; i < count; i++) | |
System.out.print(" "); | |
} | |
private static int maxLevel(AVLNode node) { | |
if (node == null) | |
return 0; | |
return Math.max(BTreePrinter.maxLevel(node.left), BTreePrinter.maxLevel(node.right)) + 1; | |
} | |
private static <T> boolean isAllElementsNull(List<T> list) { | |
for (Object object : list) { | |
if (object != null) | |
return false; | |
} | |
return true; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment