The function travel$)$ receives root of a Binary Search Tree $($BST$)$ and a positive integer $k$ as arguments. What is the code segment printsPrints the rightmost node at level k from root

Prints the leftmost node at level $k$ from root

Prints the kth smallest element in BST

Prints the kth largest element in BST