@@ -0,0 +1,1819 @@
+package stacksandqueues;%0A%0Aimport datastructures.BinaryTreeNode;%0Aimport org.junit.jupiter.api.Test;%0A%0Aimport java.util.Arrays;%0Aimport java.util.List;%0A%0Aimport static org.junit.jupiter.api.Assertions.*;%0Aimport static stacksandqueues.ComputeBinaryTreeNodes.binaryTreeDepthOrder;%0A%0Aclass ComputeBinaryTreeNodesTest %7B%0A%0A    private List%3CList%3CInteger%3E%3E expected;%0A    private BinaryTreeNode%3CInteger%3E input;%0A%0A    @Test%0A    void binaryTreeDepthOrder1() %7B%0A        expected = Arrays.asList(%0A                Arrays.asList(314),%0A                Arrays.asList(6,6),%0A                Arrays.asList(271,561,2,271),%0A                Arrays.asList(28,0,3,1,28),%0A                Arrays.asList(17,401,257),%0A                Arrays.asList(641)%0A        );%0A        input = new BinaryTreeNode%3C%3E(314);%0A        input.left = new BinaryTreeNode%3C%3E(6);%0A        input.left.left = new BinaryTreeNode%3C%3E(271);%0A        input.left.left.left = new BinaryTreeNode%3C%3E(28);%0A        input.left.left.right = new BinaryTreeNode%3C%3E(0);%0A        input.left.right = new BinaryTreeNode%3C%3E(561);%0A        input.left.right.right = new BinaryTreeNode%3C%3E(3);%0A        input.left.right.left = new BinaryTreeNode%3C%3E(17);%0A        input.right = new BinaryTreeNode%3C%3E(6);%0A        input.right.left = new BinaryTreeNode%3C%3E(2);%0A        input.right.left.right = new BinaryTreeNode%3C%3E(1);%0A        input.right.left.right.left = new BinaryTreeNode%3C%3E(401);%0A        input.right.left.right.left.right = new BinaryTreeNode%3C%3E(641);%0A        input.right.left.right.right = new BinaryTreeNode%3C%3E(257);%0A        input.right.right = new BinaryTreeNode%3C%3E(271);%0A        input.right.right.right = new BinaryTreeNode%3C%3E(28);%0A%0A        test(expected, input);%0A    %7D%0A%0A    private void test(List%3CList%3CInteger%3E%3E expected, BinaryTreeNode%3CInteger%3E input) %7B%0A        assertEquals(expected, binaryTreeDepthOrder(input));%0A    %7D%0A%7D

compute binary tree node