两棵树的 diff 算法

class Node:
    def __init__(self, topic, children=[]):
        self.topic = topic
        self.children = children
    
    
    def _stringify(self, level=0):
        result = ""
        prefix = "——" * level
        result += f"{
     prefix}{
     self.topic}\n"
        for child in self.children:
            result += child._stringify(level + 1)
        return result


NodeA = Node("A")
NodeB = Node("B")
NodeB_ = Node("B")
NodeB