数据结构-二叉树

/**
* 构建二叉树
* @param inputList 输入序列
* @return
*/
public static TreeNode crateBinaryTree(LinkedList inputList){
TreeNode node = null;
if (inputList == null || inputList.isEmpty()){
return null;
}
Integer data = inputList.removeFirst();
if (data != null){
node = new TreeNode(data);
node.leftChild = crateBinaryTree(inputList);
node.rightChild = crateBinaryTree(inputList);
}
return node;
}

/**
 * 二叉树前序遍历
 * @param node 二叉树节点
 */
public static void preOrderTraveral(TreeNode node){

    if (node == null){
        return;
    }
    System.out.println(node.data);
    preOrderTraveral(node.leftChild);
    preOrderTraveral(node.rightChild);
}

/**
 * 二叉树中序遍历
 * @param node 二叉树节点
 */
public static void inOrderTraveral(TreeNode node){
    if (node == null){
        return;
    }
    inOrderTraveral(node.leftChild);
    System.out.println(node.data);
    inOrderTraveral(node.rightChild);
}

/**
 * 二叉树后序遍历
 * @param node 二叉树节点
 */
public static void postOrderTraveral(TreeNode node){
    if (node == null){
        return;
    }
    postOrderTraveral(node.leftChild);
    System.out.println(node.data);
    postOrderTraveral(node.rightChild);
}

private static class TreeNode{
    int data;
    TreeNode leftChild;
    TreeNode rightChild;
    TreeNode(int data) {
        this.data = data;
        }
}

public static void main(String[] args) {
    LinkedList<Integer> inputList = new LinkedList<Integer>(
            Arrays.asList(new Integer[]{3,2,9,null,null,10,null,null,8,null,4}));
    TreeNode treeNode = crateBinaryTree(inputList);
    System.out.println(" 前序遍历：");
    preOrderTraveral(treeNode);
    System.out.println(" 中序遍历：");
    inOrderTraveral(treeNode);
    System.out.println(" 后序遍历：");
    postOrderTraveral(treeNode);

}