Running time of counting nodes in a given range in a BST algorithm

Question

I got the pseudocode for the following algorithm, with r being the root of a BST and x,y are numbers with x

TreeCount(r,x,y)

if r=null:

    return 0