Skip to content
Snippets Groups Projects
Commit 216863d6 authored by Martin Mareš's avatar Martin Mareš
Browse files

Successor: Updated task description to explain what should be submitted

parent e52f1b4b
No related branches found
No related tags found
No related merge requests found
Show whitespace changes
Inline Side-by-side
01-tree_successor/task.md
+ 2
− 0
View file @ 216863d6
...@@ -6,3 +6,5 @@ and it should return another node of the tree with the next higher key ...@@ -6,3 +6,5 @@ and it should return another node of the tree with the next higher key
- If there is no such node, it should return a null pointer. - 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 - The given node can also be a null pointer, in which case the method should
return the smallest node in the tree. return the smallest node in the tree.
You should submit the file `tree_successor.h`.
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment