A Tree presents information in an hierarchical relationship. There are different ways to implement hierarchies in Tk.
As a list, where each »leaf« is indented in relationship to its parent »node«. A Tcl/Tk 'text' window can be used to implement such an hierarchy.
There are similar hierarchies, many of them written in C or C++, mainly to gain good performance.
As with every Graphical User Interface, performance does not result from using a certain language.
The Rtl_tree does not guess or assume the size of its nodes. All nodes may exceed the allotted height, defined through the »-indenty« property. This requires an implementation were every child node must be drawn whenever the parent node is being expanded.
The Rtl_tree allows to delay data acquisition to when a node is opened. There is a bunch of callback commands, which constitute the on-demand acquisition; see Figure 4.7, “Rtl_tree Callback and Font Properties” and also dragfcn.
The Rtl_tree splits the hierarchy into three sections. The section before the change, the section after the change and the section reflecting the change.