Mercurial > louis > peeves

view graphs_trees/next_smallest_integer_in_bst/question.rst @ 0:20fea762903e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Import some exercises and solutions
author Louis Opter <kalessin@kalessin.fr>
date Sat, 29 Jun 2013 19:30:31 -0700
parents
children
line wrap: on
line source

Find the Next Smallest Integer in a BST
=======================================

Write the function ``next_smallest(root, n) → int`` that takes a binary search
tree in parameter and return the biggest integer in the tree which is < n.