binary_tree 1.0.1

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.

example/binary_tree_example.dart

import 'package:binary_tree/binary_tree.dart';

void main() {
  var b = BinaryTree([10, 8, 16, 4, 9, 13, 25, 2, 6, 12, 14, 18]);

  b.insert(26);
  b.insert(27);
  b.remove(27);

  print(b.toListFrom(8, equal: false, greaterThen: true));

  return;
}