Árbol binario en dardo
class Node<T> {
final T value;
Node<T> left, right;
Node(this.value, {this.left, this.right});
}
Lazy Leopard
class Node<T> {
final T value;
Node<T> left, right;
Node(this.value, {this.left, this.right});
}