public static void main(String args[]) {
TreeNode<Integer> root = new TreeNode<Integer>();
Tree tree = new Tree();
// tree.buildTree(root);
int[] array = {2, 5, 3, 2, 5, 6};
root = tree.createBST(array, 0, array.length - 1);
tree.BFS(root);
ArrayList<int[]> res = tree.findPath(root, 10);
Iterator<int[]> itr = res.iterator();
while (itr.hasNext()) {
tree.printArray(itr.next());
}
// System.out.println(isBalanced(root));
}
