# Minimum AVL Tree

**Discrete Mathematics**Level 5

An AVL tree is a rooted binary tree such that, for any node, the subtrees of its children have difference of height of at most 1. (An empty tree with no nodes has height 0, a tree with a single node has height 1.)

What is the fewest nodes an AVL tree with height 10 could have?