We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 00e54e9 commit bb70a51Copy full SHA for bb70a51
src/binarytree.jl
@@ -189,10 +189,10 @@ maxnode(node::Nothing) = nothing
189
"""
190
BinaryTrees.prevnext(tree, k)
191
192
-Returns a `tuple` of each `node` immediately before
193
-and after the `node` with `key`, `k` within `tree`.
+Returns a tuple of each node immediately before
+and after the `tree` node with key `k`.
194
195
-If an adjacent `node` does not exist, `nothing` is returned in its place.
+If an adjacent node does not exist, `nothing` is returned in its place.
196
If `k` is `nothing`, returns `(nothing, nothing)`.
197
198
function prevnext(tree::BinaryTree, k)
0 commit comments