give root binary search tree integer k return kth small value 1indexed value nod tree example 1input root 314null2 k 1Output 1Example 2input root 53624nullnull1 k 3output 3 ConstraintsThe number nod tree n1 k n 1040 Nodeval 104 Follow if BST modify ie insert delete operation need find kth smallest frequently optimize