Teken aan
Besonderhede van voorbeeld: -3203112503425843375
terug
Metadata
Author:
Literature
Data
English
[en]
Show that the height h of an n-vertex balanced binary tree satisfies h = O(lg n).
Spanish
[es]
Muestre que la altura It de un árbol binario balanceado con n vértices satisface h = O(lg n).
History
Your action:
Comment
Mark incorrect example
Please enable JavaScript.