Java: Find the Closest Element in Binary Search Tree

Difficulty Level: MEDIUM

Problem Statement:

Given a binary search tree and a target node K. The task is to find the node with a minimum absolute difference with the given target value K.

Input:

K = 18

Output:

17