printtree 28 29 java

1//printtree() java
2
3import java.util.ArrayList;
4import java.util.Collections;
5import java.util.List;
6
7public class BTreePrinterTest {
8
9    private static Node<Integer> test1() {
10        Node<Integer> root = new Node<Integer>(2);
11        Node<Integer> n11 = new Node<Integer>(7);
12        Node<Integer> n12 = new Node<Integer>(5);
13        Node<Integer> n21 = new Node<Integer>(2);
14        Node<Integer> n22 = new Node<Integer>(6);
15        Node<Integer> n23 = new Node<Integer>(3);
16        Node<Integer> n24 = new Node<Integer>(6);
17        Node<Integer> n31 = new Node<Integer>(5);
18        Node<Integer> n32 = new Node<Integer>(8);
19        Node<Integer> n33 = new Node<Integer>(4);
20        Node<Integer> n34 = new Node<Integer>(5);
21        Node<Integer> n35 = new Node<Integer>(8);
22        Node<Integer> n36 = new Node<Integer>(4);
23        Node<Integer> n37 = new Node<Integer>(5);
24        Node<Integer> n38 = new Node<Integer>(8);
25
26        root.left = n11;
27        root.right = n12;
28
29        n11.left = n21;
30        n11.right = n22;
31        n12.left = n23;
32        n12.right = n24;
33
34        n21.left = n31;
35        n21.right = n32;
36        n22.left = n33;