leafRight method

BinaryNode leafRight()

Implementation

T leafRight() {
  List<T> children = [];
  T node = this as T;
  while ((children = node.children).isNotEmpty) {
    node = children[children.length - 1];
  }
  return node;
}