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, for a **Binary Search Tree** how do you find the **node with largest value**?

Answer

You **find the right most node** by starting from the root node as being current node and keep making the right child the new current node, until there is no more right child, that last node is then the node with largest value.

Question

In algorithms, for a **Binary Search Tree** how do you find the **node with largest value**?

Answer

?

Question

In algorithms, for a **Binary Search Tree** how do you find the **node with largest value**?

Answer

You **find the right most node** by starting from the root node as being current node and keep making the right child the new current node, until there is no more right child, that last node is then the node with largest value.

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.