Just [[currentUser.getNumFreeQuestionsLeft()]] No more free questions left!

Write a function to see if a binary tree is "superbalanced" (a new tree property we just made up).

A tree is "superbalanced" if the difference between the depths of any two leaf nodes is no greater than one.

Here's a sample binary tree node class:

public static class BinaryTreeNode { public int value; public BinaryTreeNode left; public BinaryTreeNode right; public BinaryTreeNode(int value) { this.value = value; } public BinaryTreeNode insertLeft(int leftValue) { this.left = new BinaryTreeNode(leftValue); return this.left; } public BinaryTreeNode insertRight(int rightValue) { this.right = new BinaryTreeNode(rightValue); return this.right; } }

Your first thought might be to write a recursive function, thinking, "the tree is balanced if the left subtree is balanced and the right subtree is balanced." This kind of approach works well for some other tree problems.

But this isn't quite true. Counterexample: suppose that from the root of our tree:

• The left subtree only has leaves at depths 10 and 11.
• The right subtree only has leaves at depths 11 and 12.

Both subtrees are balanced, but from the root we will have leaves at 3 different depths.

We could instead have our recursive function get the array of distinct leaf depths for each subtree. That could work fine. But let's come up with an iterative solution instead. It's usually better to use an iterative solution instead of a recursive one because it avoids stack overflow.

We can do this in time and space.

### You must log in with one click to view the rest.

Once you're logged in, you'll get free full access to this and 4 other questions.

### You must log in with one click to view the rest.

Once you're logged in, you'll get free full access to this and 4 other questions.

time and space.

For time, the worst case is the tree is balanced and we have to iterate over all n nodes to make sure.

For the space cost, we have two data structures to watch: depths and nodes.

depths will never hold more than three elements, so we can write that off as .

Because we’re doing a depth first search, nodes will hold at most d nodes where d is the depth of the tree (the number of levels in the tree from the root node down to the lowest node). So we could say our space cost is .

But we can also relate d to n. In a balanced tree, d is . And the more unbalanced the tree gets, the closer d gets to n.

In the worst case, the tree is a straight line of right children from the root where every node in that line also has a left child. The traversal will walk down the line of right children, adding a new left child to nodes at each step. When the traversal hits the rightmost node, nodes will hold half of the n total nodes in the tree. Half $n$ is , so our worst case space cost is .

### You must log in with one click to view the rest.

Once you're logged in, you'll get free full access to this and 4 other questions.

What's next?