How to distinguish a wide tree data structure from a binary tree by their features?

The main difference between a wide tree and a binary tree is the number of descendants each node can have:

• Binary tree — each node has no more than two descendants (left and right).
• Wide tree (n-ary tree) — nodes can have an arbitrary number of descendants.

Features:

• In a binary tree, the structure is fixed: a maximum of two children, which simplifies traversal and balancing algorithms.
• In a wide tree, the number of children varies, allowing for modeling more complex hierarchies (e.g., a file system tree).

Example:

// Binary tree
class BinaryNode {
    public int Value;
    public BinaryNode Left;
    public BinaryNode Right;
}

// Wide tree
class WideNode {
    public int Value;
    public List<WideNode> Children = new List<WideNode>();
}

Thus, to distinguish the structure, look at the restriction on the number of descendants and how they are stored.