binary_tree

Self-Balancing Binary Search Tree for Dart. BST is implemented as Iterable. There are many operations such as greaterThen, lessThenOrEqual (create sublist), max , min etc.

1.0.7 Mehmetyaz/binary_tree

What this package is like to depend on

Last release 1 years ago

11 May 2025

Release timing varies

gaps range from 3 weeks to 2.4 years

Nearly every release is documented

notes for 8 of 8 stable releases

Nothing withdrawn

no release was ever pulled

4 years old

8 releases · first in 2022

0 releases in the last 12 months

see the full history below

Release timeline

8 releases · Mar 2022 to May 2025

2023 2024 2025 2026

Release Pre-release

Releases

latest 8

1.0.7 11 May 2025
Release notes
- Fix bug in BinaryTree.remove(T element).
Open source →
1.0.6 08 Aug 2024
Release notes
- Fix comparison operators
- sdk version updated
Open source →
1.0.5 26 Mar 2022
Release notes
- search added
- different type comparison support. (E.g test/methods_test.dart)
Open source →
1.0.4 10 Mar 2022
Release notes
- change == to identical || ==
Open source →
1.0.3 08 Mar 2022
Release notes
- Bound added to iteratorFrom.
- Readme changed
- change == to identical
Open source →
1.0.2 03 Mar 2022
Release notes
- Added tree type(AVL) to readme
- All then renamed to than
- code cleanup
Open source →
1.0.1 02 Mar 2022
Release notes
- Readme.md updated
Open source →
1.0.0 02 Mar 2022
Release notes
- Initial version.
Open source →

binary_tree

What this package is like to depend on

Release timeline

Releases

Every package, every release, already written down.