Tresize&find by val

[FatAndreasbot]

Added some wanted by me functionality

[kingledion]

Depending on your use case, if you really want to search by value, you have two options for a well implemented function.

1. You can hash the value T that you want to store and then use that hash as the primary key. Then, use the existing Find function to return your desired Node(s)
2. If you still need a distinct primary key, you can implement an optional second index on values. This would work like the above, it would store a map of the hashed values of T to pointers to the desired Node.

The first would be best implemented as a wrapper around this code, the second would be an addition to this.

Both of these solutions will be much faster O(1), at the cost of some additional memory allocation.

[FatAndreasbot]

The issue with a hash index is that we can store identical data in the same tree. That's why I created two methods for the Tree structure. "FindByValue", which returns the first found, and a false "ok" value, if the node data is not unique. And "FindMultipleByValue", which will return a list of all nodes with the searched data/value.