mirrored Leaf in unbalanced Hierarchie
Nico Gerbrand
Employee
The unbalanced hierarchy is a strong function. Unfortunately, it is only possible to aggregate using a single tree.
Hierarchy nodes | Description |
|---|---|
Root Node | A node that is not assigned under any node and has no parent node (predecessor). |
Node | A node that has successors, which means all nodes except for leaves. |
Leaf | A node without lower-level nodes (successors). |
The idea is to mirror leaves.
Nodes cannot be mirrored.
Nodes must be unique and unambiguous.
@Steve Pankrath mentioned this Idea before.
Tagged:
8