Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

Question

In algorithms, the **time complexity** to find the **minimum or maximum value in a Binary Search Tree** is **[...]**

Answer

O(h), where h is height of tree.

Question

In algorithms, the **time complexity** to find the **minimum or maximum value in a Binary Search Tree** is **[...]**

Answer

?

Question

In algorithms, the **time complexity** to find the **minimum or maximum value in a Binary Search Tree** is **[...]**

Answer

O(h), where h is height of tree.

If you want to change selection, open document below and click on "Move attachment"

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Do you want to join discussion? Click here to log in or create user.