Given a binary search tree, write a method to find the nth smallest element in the tree. For example: Given the Tree: 8 ↙ ↘ 3 10 ↙ ↘ ↘ 1 6 14 ↙ ↘ ↙ 4 7 13 And N = 4, your method would return 6.

possible solution

using System.Collections.Generic;


public int smallElement(int k)
{
    Node<T> node = Root;
    int count = k;
    int sizeOfSubTree =0;
    
    while (node != null)
    {
        sizeOfSubTree = node.SizeOfLeftSubTree();
        if(sizeOfSubTree +1 == count)
        {
            return node.Value;
        }
        else if(sizeOfSubTree +1 < count)
        {
            node=node.Right;
            count -= sizeOfSubTree +1 ;
            
        }
        else
        {
            
            node = node.Right;
        }
        
    }
    return -1;
    
    
}