https://kotlinlang.org logo
#announcements
Title
# announcements
a

Alex Kuznetsov

10/31/2019, 10:20 PM
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)
k

Kroppeb

11/02/2019, 11:29 PM
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.
a

Alex Kuznetsov

11/05/2019, 11:38 PM
@Kroppeb and in which libraries can I find balanced search trees?
k

Kroppeb

11/05/2019, 11:58 PM
java.util.TreeSet
or
java.util.TreeMap
. They are based on a Red-Black tree
👍 1
a

Alex Kuznetsov

11/07/2019, 1:09 AM
We'll have to port them to pure Kotlin.
5 Views