Loop through the siblings to see which one reached the end first, which means it is the one with smaller in children size, and we should try to relocate the smaller one.
(&self, base_n: i32, base_p: i32, mut c_n: u8, mut c_p: u8)
source not stored for this graph (policy: none)