the function need to be implemented in Python

the AVL - Tree here is the BST that the heights of the two child subtrees of any node differ by at most one

3. [12] The function nun trees takes the total number of nodes and the number of leares, and returns the number of AVI-balanced tree shapes with that many nodes and leaves Here is a sample call of nun, trees: nuntrees(5, 3) This menns that there are exactly two AVL-balanced trees that have five nodes where three of thase nodes are leves Here are those two trees: Implement nun trees