Python 实现二叉树的创建、二叉树的添加、二叉树的删除、二叉树的修改、二叉树的查找、二叉树的的遍历 最详细的二叉树 增 删 改 查

二叉树的创建、添加和遍历

• 因为我之前文章>>>二叉树详解 已经详细写了二叉树的创建以及二叉树的广度和深度遍历，这里就不重复叙述实现过程，直接将代码规范书写如下：
  

class TreeNote(object): # 创建树的结点
    def __init__(self, val=-1):
        self.val = val
        self.left = None
        self.right = None


class BinaryTree(object): # 创建二叉树
    def __init__(self):
        self.root = None # 根结点

    def add(self, val):  # 二叉树添加结点
        node = TreeNote(val)
        if self.root is None:
            self.root = node
            return
        queue = [self.root]
        while queue:
            temp_node = queue.pop(0)
            if temp_node.left is None:
                temp_node.left = node
                return
            else:
                queue.append(temp_node.left)
            if temp_node.right is None:
                temp_node.right = node
                return
            else:
                queue.append(temp_node.right)

    def bre_order(self, node):  # 二叉树的广度遍历
        if node is None:
            return
        queue = [node]
        while queue:
            temp_node = queue.pop(0)
            print(temp_node.val, end=" ")
            if temp_node.left is not None:
                queue.append(temp_node.left)
            if temp_node.right is not None:
                queue.append(temp_node.right)

    '''递归实现二叉树的三种深度遍历'''
    # def pre_order(self, node):  # 二叉树的前序遍历（递归）
    #     if node is None:
    #         return
    #     print(node.val, end=" ")
    #     self.pre_order(node.left)
    #     self.pre_order(node.right)
    #
    # def in_order(self, node):  # 二叉树的中序遍历（递归）
    #     if node is None:
    #         return
    #     self.in_order(node.left)
    #     print(node.val, end=" ")
    #     self.in_order(node.right)
    #
    # def post_order(self, node): # 二叉树的后序遍历（递归)
    #     if node is None:
    #         return
    #     self.post_order(node.left)
    #     self.post_order(node.right)
    #     print(node.val, end=" ")

    '''非递归实现二叉树的三种深度遍历'''
    def pre_order(self, node):
        if node is None:
            return
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                print(temp_node.val, end=" ")
                stack.append(temp_node)
                temp_node = temp_node.left
            node = stack.pop()
            temp_node = node.right

    def in_order(self, node):
        if node is None:
            return
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                stack.append(temp_node)
                temp_node = temp_node.left
            node = stack.pop()
            print(node.val, end=" ")
            temp_node = node.right

    def post_order(self, node):  # 二叉树的后序遍历（非递归)
        if node is None:
            return None
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                stack.append(temp_node)
                temp_node = temp_node.left
            left_node = stack[-1]
            temp_node = left_node.right
            if temp_node is None:
                node = stack.pop()
                print(node.val, end=" ")
                while stack and node == stack[-1].right:
                    node = stack.pop()
                    print(node.val, end=" ")


if __name_