在BST中查找比给定值高的值的数量

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def countNodes(root, target):
    if root is None:
        return 0
    
    if root.val <= target:
        return countNodes(root.right, target)
    else:
        return 1 + countNodes(root.left, target) + countNodes(root.right, target)

# 示例用法
root = TreeNode(5)
root.left = TreeNode(3)
root.right = TreeNode(7)
root.left.left = TreeNode(2)
root.left.right = TreeNode(4)
root.right.left = TreeNode(6)
root.right.right = TreeNode(8)

target = 5
count = countNodes(root, target)
print("比给定值高的值的数量为:", count)