In this case, it would store its decisions, and then update the array of nodes after its last decision.

在这种情况下，它将存储它的判定，然后在最后一个判定做出后更新数组的节点。

youdao

When a user clicks on one of the nodes in the example, the tree will ask the store to load the item and the store will request the resource.

在本例中，当用户点击其中一个节点时，树将请求存储库加载条目，存储库将请求资源。

youdao

Using that concept, you can also store Pointers to list nodes in your node, allowing you to have lists as the data for a list node. Here's how it might look.

同理，您也可以在节点中存储指向列表节点的指针，这样就可以将列表作为列表节点的数据。

youdao