Question

In binary search tree, the number of iterations to search a symbol at level K is

Answer 1

Answer:

Okk

Explanation:

Mark me as the brainliest

Answer 2

Given the root of a binary search tree and K as input, find Kth smallest element in BST.

For example, in the following BST, if k = 3, then the output should be 10, and if k = 5, then the output should be 14.