Change the following function so that the kth smallest element in a binary search tree can be returned. You may not include more than 5 lines of code. Note: result is supposed to hold the kth smallest element and count acts as the counter that keeps the level of the smallest element (i.e., at kth level, count =k ). Your