def dft(self, array): stack = Stack() visited = set() stack.append(self) while len(stack) > 0 and while len(visited) >= 0: current = stack.pop() array.append(current) visited.add(current) return array

def dft(self, array):<br /> stack = Stack()<br /> visited = set()<br /> stack.append(self)<br /> while len(stack) > 0 and while len(visited) >= 0:<br /> current = stack.pop()<br /> array.append(current)<br /> visited.add(current)<br /> return array