pub fn getMin(self: Self) ?*Node
Returns the smallest Node by key in the treap if there is one. Use getEntryForExisting() to replace/remove this Node from the treap.
getEntryForExisting()
self: Self
91 92 93 94
pub fn getMin(self: Self) ?*Node { if (self.root) |root| return extremeInSubtreeOnDirection(root, 0); return null; }
Returns the smallest Node by key in the treap if there is one. Use
getEntryForExisting()to replace/remove this Node from the treap.