package src.utils;

import src.common.node.TreeNode;

import src.common.tree.BinarySearchTree;

import src.common.tree.FullBinaryTree;

import src.common.node.TreeNodeWithParent;

import src.common.tree.NormalBinaryTree;

import java.util.Deque;

import java.util.LinkedList;

public class GeneralUtils {

//[5,4,6,null,null,3,7]

public static TreeNode constructNormalBinaryTree(Integer[] nums){

return new NormalBinaryTree().createTreeByRecursion(nums);

}

public static TreeNode constructBinarySearchTree(Integer[] nums){

return new BinarySearchTree().createTreeByRecursion(nums);

}

/**

* 生成 几层满二叉树

* @param level

* @return

*/

public static TreeNodeWithParent<Integer> constructFullBinaryNode(int level){

TreeNodeWithParent<Integer> rootNode = FullBinaryTree.genBinaryTree(level);

return rootNode;

}

public static void main(String[] args) {

// Integer[] arr = new Integer[]{5,4,6,null,null,3,7};

// printTreeNode(constructTree(arr));

TreeNodeWithParent<Integer> node = constructFullBinaryNode(10);

PrintTreeUtils.printTreeNode(node);

}

}