Home/ Questions/Q 8062301
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-05T10:37:15+00:00

I’m trying to find a way to create a binary tree where 3 doubles

  • 0

I’m trying to find a way to create a binary tree where 3 doubles are stored in each node and another tree where 6 doubles are stored in each node.

The problem I’m having is figuring out a way to implement find and insert methods (no need for remove).

Basically, my tree is holding x, y, z values and when I call find, I want it to return the node which contains x, y, and z values closest to those I am trying to find.

How should I be approaching this problem and what are some ideas for a solution?

Thanks!

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    It seems that you are looking for k-d tree data structure, which also allows finding nearest neighbor to a given element.

    • 0