Returns the next smallest value(predecessor) in the tree after succ. Returns `None` if there is no predecessor. pred() is almost a mirror of succ(). Differences are noted in comments.
(&self, succ: u32)
Source from the content-addressed store, hash-verified