def get_sibling_counts(ptree: ParentedTree) -> (int, int): if not ptree.parent(): return 0, 0 left_siblings = ptree.parent_index() right_siblings = len(ptree.parent()) - left_siblings - 1 return left_siblings, right_siblings