如何过滤avl树的数据

class AVLNode:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None
        self.height = 1

class AVLTree:
    def __init__(self):
        self.root = None

    def insert(self, root, data):
        if not root:
            return AVLNode(data)
        elif data < root.data:
            root.left = self.insert(root.left, data)
        else:
            root.right = self.insert(root.right, data)

        root.height = 1 + max(self.getHeight(root.left), self.getHeight(root.right))

        balanceFactor = self.getBalance(root)

        if balanceFactor > 1:
            if data < root.left.data:
                return self.rightRotate(root)
            else:
                root.left = self.leftRotate(root.left)
                return self.rightRotate(root)

        if balanceFactor < -1:
            if data > root.right.data:
                return self.leftRotate(root)
            else:
                root.right = self.rightRotate(root.right)
                return self.leftRotate(root)

        return root

    def getHeight(self, root):
        if not root:
            return 0
        return root.height

    def getBalance(self, root):
        if not root:
            return 0
        return self.getHeight(root.left) - self.getHeight(root.right)

    def leftRotate(self, z):
        y = z.right
        T2 = y.left

        y.left = z
        z.right = T2

        z.height = 1 + max(self.getHeight(z.left), self.getHeight(z.right))
        y.height = 1 + max(self.getHeight(y.left), self.getHeight(y.right))

        return y

    def rightRotate(self, z):
        y = z.left
        T3 = y.right

        y.right = z
        z.left = T3

        z.height = 1 + max(self.getHeight(z.left), self.getHeight(z.right))
        y.height = 1 + max(self.getHeight(y.left), self.getHeight(y.right))

        return y

    def filterData(self, root, condition, result):
        if root:
            if condition(root.data):
                result.append(root.data)
            self.filterData(root.left, condition, result)
            self.filterData(root.right, condition, result)

    def filterAVLTree(self, condition):
        result = []
        self.filterData(self.root, condition, result)
        return result

# 示例用法
tree = AVLTree()
tree.root = tree.insert(tree.root, 5)
tree.root = tree.insert(tree.root, 3)
tree.root = tree.insert(tree.root, 7)
tree.root = tree.insert(tree.root, 2)
tree.root = tree.insert(tree.root, 4)
tree.root = tree.insert(tree.root, 6)
tree.root = tree.insert(tree.root, 8)

# 过滤条件：只保留大于等于5的节点
filtered_data = tree.filterAVLTree(lambda x: x >= 5)
print(filtered_data)