Jump to content

Red black tree sort/Julia: Difference between revisions

m
typo
(julia example)
 
m (typo)
Line 51:
Returns the last visited node, while traversing through in binary-search-tree fashion looking for `key`.
"""
search_node(tree, key)
 
function search_node(tree::RBTree{K}, d::K) where K
node = tree.root
4,108

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.