Skip to content
Snippets Groups Projects
Select Git revision
  • ca0e52bf670b063c7a2cfc307a86b4676862558f
  • master default protected
2 results

task.md

Blame
    • task.md 545 B

    Given an implementation of a simple binary search tree including parent pointers, implement a successor method. The methods is given a node and it should return another node of the tree with the next higher key (i.e., the smallest of keys which are greater than the given one).

    • If there is no such node, it should return a null pointer.
    • The given node can also be a null pointer, in which case the method should return the smallest node in the tree.

    You should submit the file tree_successor.* (but not the tree_successor_test.*).