leafLeft method

T leafLeft()

返回当前节点下最左边的叶子节点

Implementation

T leafLeft() {
  List<T> children = [];
  T node = this as T;
  while ((children = node.children).isNotEmpty) {
    node = children[0];
  }
  return node;
}