摘要：采用递归调用构建二叉树、打印、删除、计算层级 class Node(): def __init__(self,data=None): self.data = data self.left = None self.right = None def insert(self,data): if self. 阅读全文