fix: workaround for Knn KD tree

[Alexandr-Solovev]

Description

The pull request introduces a workaround for the K-Nearest Neighbors (KNN) algorithm. This fix addresses issues related to the algorithm's execution in threading part of KNN KD-tree. Additionally, the memory usage has improved. With these fix we will observe temporary performance degradations. The fix will be done in https://github.com/oneapi-src/oneDAL/pull/2925

---

Checklist to comply with before moving PR from draft:

Testing

• [x] I have run it locally and tested the changes extensively.
• [x] All CI jobs are green or I have provided justification why they aren't.

Performance

• [x] I have provided justification why performance has changed or why changes are not expected.

[Alexandr-Solovev]

/intelci: run

[Alexandr-Solovev]

/intelci: run

[Alexandr-Solovev]

/intelci: run

[ethanglaser]

Lets confirm nightly scope looks good before merge: http://intel-ci.intel.com/ef9157c5-2e90-f1bd-ac26-a4bf010d0e2d