AVL trees were one of the first balanced tree structures to provide $O(\log n)$ operations and do so based on height differences between left and right subtree. Look at the wiki link for an exact definition.
Can you give an algorithm to compute the number of AVL trees having exactly $n$ nodes?
[Solution]
Can you give an algorithm to compute the number of AVL trees having exactly $n$ nodes?
[Solution]
No comments:
Post a Comment