A YANG leaf-list represents a sequence of scalar values of the same defined type. Like a leaf, each value is terminal and cannot contain child nodes. However, unlike a single leaf, a leaf-list can have multiple entries. A YANG list also supports multiple instances, but each list entry can contain child nodes and is normally identified by one or more key leaves. A container groups related child nodes but does not itself represent a repeated collection of scalar values. A choice defines alternative branches in a data model, allowing one set of nodes from the available cases to be selected. Correctly distinguishing these node types is important when interpreting YANG schemas used to configure and monitor access devices through model-driven management interfaces.