Count Nodes in BST

You are given the root of a binary search tree (BST). Your task is to write a function that counts the number of nodes in the tree. A BST is a tree in which for each node, all values in the left subtree are less, and all values in the right subtree are greater than the node's value. Input Format: The first line contains an integer N, the number of nodes in the BST. The next N lines each contain an integer value, representing the value of each node in the BST. The values are presented in the order of insertion into the tree. Output Format: Output a single integer, the count of nodes in the BST. Example: Input: 3 5 3 7 Output: 3