# A computer science problem by Thaddeus Abiy

An AVL tree is a balanced binary search tree where every node in the tree satisfies the following property:

The height difference between its left and right children is at most 1.

Let $$N(h)$$ be the minimum number of nodes in an AVL tree of height $$h$$. What is $$N(152363)\bmod{ 2^{12} }$$?

×