traversedFlatList method

List<TreeNode<Object?>> traversedFlatList()

Computes a list with all the nodes by traversing them depth first.

This method is more expensive than flatList but the nodes will have a reliable order.

Implementation

List<TreeNode> traversedFlatList() {
  final nodes = <TreeNode>[];

  traverse((node) => nodes.add(node));

  return nodes;
}