public int maxDepth(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<>();
while (!queue.isEmpty()) {
for (int i = 0; i < size; i++) {
TreeNode curNode = queue.remove();
if (curNode.left != null) {
if (curNode.right != null) {
queue.add(curNode.right);