def _get_total(tots, node):
if (node.is_leaf() or node.is_root()):<EOL><INDENT>return <NUM_LIT:0><EOL><DEDENT>else:<EOL><INDENT>if len(node.children) > <NUM_LIT:2>:<EOL><INDENT>down_r = node.children[<NUM_LIT:0>]<EOL>down_l = node.children[<NUM_LIT:1>]<EOL>for child in node.children[<NUM_LIT:2>:]:<EOL><INDENT>down_l += child<EOL><DEDENT><DEDENT>else:<EOL><INDENT>down_r, down_l = node.children<EOL><DEDENT>lendr = sum(<NUM_LIT:1> for i in down_r.iter_leaves())<EOL>lendl = sum(<NUM_LIT:1> for i in down_l.iter_leaves())<EOL>up_r = node.get_sisters()[<NUM_LIT:0>]<EOL>lenur = sum(<NUM_LIT:1> for i in up_r.iter_leaves())<EOL>lenul = tots - (lendr + lendl + lenur)<EOL>return lendr * lendl * lenur * lenul<EOL><DEDENT>
get total number of quartets possible for a split