1. A computer-readable non-transitory storage medium having instructions therein that when executed by the machine, cause the machine to: receive a data structure including a plurality of levels, a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes; build a graphical tree hierarchy associated with the data structure; horizontally aggregate at least a portion of the plurality of non-leaf nodes at an entire level of the graphical tree hierarchy to form a plurality of aggregation nodes, upon determining that a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level; define a histogram plotted along a base of the graphical tree hierarchy comprising a set of bins correspondingly associated with the plurality of aggregation nodes, the plurality of leaf nodes defining a count for each bin of the histogram; upon determining that the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels, vertically scale down proportionally the plurality of leaf nodes in each bin of the histogram to a plurality of leaf node icons such that the plurality of leaf node icons fit in a predefined GUI region, wherein a leaf node icon of the plurality of leaf node icons represents a number of leaf nodes computed based on a maximum allowed number of leaf nodes in an aggregated node of the plurality of aggregation nodes and a number of leaf nodes in a largest aggregation node of the plurality of aggregation nodes; and display the graphical tree hierarchy in the predefined GUI region, the displayed graphical tree being associated with the data structure and accompanying metadata.