Tree storing multiple values per node

Question

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!

What language are you implementing this tree in? – Hans Z Jun 06 '12 at 20:33 — Hans Z, Jun 06 '12 at 20:33

score 4 · Accepted Answer · answered Jun 06 '12 at 20:41

4

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

answered Jun 06 '12 at 20:41

amit

175,853
27
231
333

I think you are probably right, @amit, in that OP is looking for something to help in 3D-ish thingy. – bluevector Jun 06 '12 at 21:00

score 1 · Answer 2 · answered Jun 06 '12 at 20:40

1

 public class BinaryTreeNode<T>
 {
    public T Value {get; set;}

    public BinaryTreeNode<T> Left {get; set;}
    public BinaryTreeNode<T> Right {get; set;}

    public BinaryTreeNode<T> Seach(T forWhat)
    {
       if(Value == forWhat) return this;

       BinaryTreeNode<T> leftResult = Left.Search(forWhat);
       if(leftResult != null) return leftResult;

       BinaryTreeNode<T> rightResult = Right.Search(forWhat);
       if(rightResult != null) return rightResult;

       return null;
    }
 }

 BinaryTreeNode<Tuple<double, double, double>> threeDoublesTree = new BinaryTreeNode<Tuple<double, double, double>>();

 BinaryTreeNode<Tuple<double, double, double, double, double, double>> sixDoublesTree = new BinaryTreeNode<Tuple<double, double, double, double, double, double>>();

answered Jun 06 '12 at 20:40

bluevector

3,485
1
15
18

How will it find nearest neighbor for an entree? care to elaborate? – amit Jun 06 '12 at 20:42
You mean exhaustively? won't the time consumption of it be linear in the number of elements in the tree? Or am I misunderstanding you? – amit Jun 06 '12 at 20:47
Linear? Not necessarily. @Joshua, are you storing the value tuple in some order or not? [see this about the Big-O](http://www.cs.duke.edu/~ola/ap/recurrence.html) – bluevector Jun 06 '12 at 20:58

score 0 · Answer 3 · answered Jun 06 '12 at 20:38

Basically you store 1 value per node. You can treat those x, y, z values as 3D points. On the left of one node you putpoint closer to (0, 0, 0) and on the right you hold further ones. If you have structure like this you can search and insert data as you would in ordinary binary tree.

Tree storing multiple values per node

3 Answers3