شجرة البحث الثنائية

class Node:    def __init__(self, key):        self.key = key        self.left = None        self.right = None def insert(node, key):    if node is None:        return Node(key)    if key < node.key:        node.left = insert(node.left, key)    elif key > node.key:        node.right = insert(node.right, key)    return node def search(node, key):    steps = 0    while node is not None:        steps += 1        if key == node.key:            return True, steps        node = node.left if key < node.key else node.right    return False, steps def inorder(node, out):    if node is not None:        inorder(node.left, out)        out.append(node.key)        inorder(node.right, out)    return out root = Nonefor k in [8, 3, 10, 1, 6, 14]:    root = insert(root, k)print(inorder(root, []))print(search(root, 6))