Function merklebtree::node::right_sibling

pub fn right_sibling<T>(
    node_id: i32, 
    value: &T, 
    nodes: &mut Nodes<T>
) -> (i32, i32) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

rightSibling returns the node's right sibling and child index (in parent) if it exists, otherwise (-1,-1) key is any of keys in node (could even be deleted).