The recently integrated red-black tree manages node allocation and placement internally. To increase flexibility and customization options, this can be modified to also support intrusive trees.
In an intrusive tree, the user has full control over node allocation and placement, allowing for more efficient memory management and tailored data structures. This would open up more potential use cases and enable users to better optimize the tree for their specific use case.
In an intrusive tree, the user has full control over node allocation and placement, allowing for more efficient memory management and tailored data structures. This would open up more potential use cases and enable users to better optimize the tree for their specific use case.
- relates to
-
JDK-8345314 Add a red–black tree as a utility data structure
-
- Resolved
-
- links to
-
Review(master) openjdk/jdk/23416