Sibling leaves in a code tree

Two leaves of a code tree with the same parent in a rooted tree. Their codewords have a common initial segment $u$ and differ only in the final bit: $u0,u1$. Their leaf depth in a code tree is equal. The Huffman sibling property places two chosen least weights at such leaves in some optimal prefix code.