树和二叉树的转换代码python_Python - 将n-ary树转换为二叉树

class Tree:

def __init__(self, new_key):

self.__key = new_key # Root key value

self.__children = [] # List of children

self.__num_of_descendants = 0 # Number of Descendants of this node

# Prints the given tree

def printTree(self):

return self.printTreeGivenPrefix("", True)

# Prints the given tree with the given prefix for the line

# last_child indicates whether the node is the last of its parent"s child

# or not

def printTreeGivenPrefix(self, line_prefix, last_child):

print(line_prefix, end="")

if last_child:

print("â””--> ", end="")

else:

print("|--> ", end="")

print(self.__key)

if len(self.__children) > 0:

next_pre = line_prefix

if last_child:

next_pre += " "

else:

next_pre += "| "

for child_index in range(len(self.__children)-1):

self.__children[child_index].\

printTreeGivenPrefix(next_pre, False)

self.__children[-1].printTreeGivenPrefix(next_pre, True)

def __repr__(self):

return "[" + str(self.__key) + "".join(

[ repr(child) for child in self