check if in binary tree exist two elements whom difference is d. O(n)

Question

Traverse Tree size of n In-order and copy elements into array size of n one by one. This way you get a sorted array in time complexity of O(n). if array is A[1...n] then declare