BinaryTreeUtilTest.java

package me.lzb.basic.tree;

import org.junit.After;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;

import java.util.List;

/**
 * @author LZB
 */
public class BinaryTreeUtilTest {
    BinaryTreeNode<Integer> root = null;

    @Before
    public void setUp() throws Exception {
        root = new BinaryTreeNode<>(1);
        root.setLeft(new BinaryTreeNode<>(2));
        root.setRight(new BinaryTreeNode<>(5));
        root.getLeft().setLeft(new BinaryTreeNode<>(3));
        root.getLeft().setRight(new BinaryTreeNode<>(4));
    }

    @After
    public void tearDown() throws Exception {
    }

    @Test
    public void testPreOrderVisit() {

        List<Integer> result = BinaryTreeUtil.preOrderVisit(root);
        Assert.assertEquals("[1, 2, 3, 4, 5]", result.toString());


    }

    @Test
    public void testInOrderVisit() {


        List<Integer> result = BinaryTreeUtil.inOrderVisit(root);
        Assert.assertEquals("[3, 2, 4, 1, 5]", result.toString());

    }

    @Test
    public void testPostOrderVisit() {


        List<Integer> result = BinaryTreeUtil.postOrderVisit(root);
        Assert.assertEquals("[3, 4, 2, 5, 1]", result.toString());

    }



    @Test
    public void testPreOrderVisitWithoutRecursion() {
        BinaryTreeNode<Integer> node = root.getLeft().getRight();
        node.setLeft(new BinaryTreeNode<>(6));
        node.setRight(new BinaryTreeNode<>(7));

        List<Integer> result = BinaryTreeUtil.preOrderWithoutRecursion(root);
        Assert.assertEquals("[1, 2, 3, 4, 6, 7, 5]", result.toString());

    }

    @Test
    public void testInOrderVisitWithoutRecursion() {
        BinaryTreeNode<Integer> node = root.getLeft().getRight();
        node.setLeft(new BinaryTreeNode<>(6));
        node.setRight(new BinaryTreeNode<>(7));

        List<Integer> result = BinaryTreeUtil.inOrderWithoutRecursion(root);
        Assert.assertEquals("[3, 2, 6, 4, 7, 1, 5]", result.toString());

    }

    @Test
    public void testPostOrderWithoutRecursion() {
        BinaryTreeNode<Integer> node = root.getLeft().getRight();
        node.setLeft(new BinaryTreeNode<>(6));
        node.setRight(new BinaryTreeNode<>(7));

        List<Integer> result = BinaryTreeUtil.postOrderWithoutRecursion(root);
        Assert.assertEquals("[3, 6, 7, 4, 2, 5, 1]", result.toString());

    }
}