def build_tree(fid, stack, tree):
if stack == [] and tree:
return tree
last = stack[-1]
if not last.left.is_connected() or (last.right is None
or not last.right.is_connected()):
line = fid.readline().replace('"', '').replace('\n',
'').replace(' \\n', '')
if len(line) < 2:
return tree
if ';' in line:
[first, second] = line.lstrip(' ').split(';')
[id_, name_, comp, cond] = first.split(' ')
[criterion, statistic] = second.split(',')
criterion = criterion.replace(' criterion = ', '')
statistic = statistic.replace(' statistic = ', '')
id_ = id_.rstrip(')')
node = Node(id_, name_, criterion, statistic)
if not last.left.is_connected():
last.left.add_node(node)
else:
last.right.add_node(node)
tree[id_] = node
edge = Edge(cond, comp == '<=')
if 'Sex' in name_:
edge.sex = True
node.add_left(edge)
stack.append(node)
return build_tree(fid, stack, tree)
# Right branch
elif '*' not in line:
[id_, name_, comp, cond] = line.lstrip(' ').replace('\n',
'').split(' ')
id_ = id_.rstrip(')')
if id_ not in tree:
tree[id_] = Node(id_, name_)
node = tree[id_]
edge = Edge(cond, comp == '<=')
if 'Sex' in name_:
edge.sex = True
node.add_right(edge)
return build_tree(fid, stack, tree)
# leaf
elif '*' in line:
[id_, second] = line.lstrip(' ').split('*')
a = second.replace('\n', '').rstrip(' ').split(' ')
id_ = id_.rstrip(')')
weight = a[len(a) - 1]
leaf = Leaf(id_, weight)
tree[id_] = leaf
if not last.left.is_connected():
edge = last.left
else:
edge = last.right
edge.add_leaf(leaf)
return build_tree(fid, stack, tree)
else:
stack.pop(-1)
return build_tree(fid, stack, tree)
