SDE - 1

1 Initially I tried with Run two nested loops from start to end and for every iteration of the outer loop, i tried to find the count of intervals that intersect with the current interval except itself.
2 Update the answer with the maximum count of overlap in each iteration of the outer loop and print ans.

But this is not best solution so i tried to improve my solution by using heap data structure.so time time complexity reduced a lot.

1 first i tried to store Inorder traversal of given binary search tree in an auxiliary array and then by taking absolute difference of each element i tried to find the node having minimum absolute difference with given target value K in linear time.
2 But its not efficient solution because i have not used the charectoristics of BST so i tried with optimised approach like 
a If my target value K is present in given BST, then it’s the node having minimum absolute difference.
b If target value K is less than the value of current node then move to the left child.
c If target value K is greater than the value of current node then move to the right child.

Tip 1: when to use which scaling we need to have deep knowledge.
Tip 2: we need to have proper answer of why we are making variables/methods are private/public/protected. 
Tip 3: proper use of Solid Principles and design principles.