Which libraries have the following: 1. Trees, B-Tr...

# announcements

[Alex Kuznetsov]

Which libraries have the following:
1. Trees, B-Trees, Black/Red Trees, traversing them leafs first and root first. Balanced search trees and rebalancing.
2. All permutations (same as CROSS JOIN in SQL)

[Kroppeb]

Why do you need all those tree types? B-Trees and Black/red trees (which are equivalent to a 2-3 B Tree) are all balanced search trees.

[Alex Kuznetsov]

@Kroppeb and in which libraries can I find balanced search trees?

[Kroppeb]

java.util.TreeSet or java.util.TreeMap. They are based on a Red-Black tree

[Alex Kuznetsov]

We'll have to port them to pure Kotlin.