I want to conclude by summarizing a little bit of the advantages and disadvantages of Treemaps, so that you have a way to think about when they are an appropriate solution for a problem that you have. So, some of the advantages that you have are definitely, I would say the first one is scalability. They scale really, really well especially compared to the existing solutions. So, I would say that, that's one of the most interesting characteristics of Treemaps. The second one is node visibility. You may have noticed that if your focus is on visualizing attributes associated to the leaves of the tree, then a Treemap is really, really good at doing that. Typically, what you can do is to represent two attributes at the same time, one mapped to the size of the rectangles, and one mapped to the color of the rectangles. So, this enables you and the readers of your visualizations to draw a lot of inferences about the data that are visualized with a TreeMap. Another thing is that since there are space filling visualization, there is no overlapping of marks, and because of that they do not create a lot of clutter, right? You may have a different problem with Treemaps that when you have too many data points, the rectangles that are used to represent every single data points may become very, very small, and that's another type of problem. As I said, they can encode three main pieces of information, one quantity with size, either a quantity or a category with color, and the hierarchy. So, what are the disadvantages? Well, I would say the biggest disadvantage is that you can't really visualize the structure very well. You can infer some of the structure, but if the focus of your visualization, and your analysis, and communication intent is to understand how a given piece of information is structured, and what is the structure of the tree or the hierarchy, then Treemaps are not particularly effective at doing that. Another problem is that if you need people to compare the rectangles and the quantities associated to the rectangles accurately well, then one problem that Treemaps have is that we are not particularly good at estimating differences when we are comparing the size of rectangles. So, this is of course mitigated to a large extent by the algorithms that I've shown you, so especially Squarified TreeMap algorithms and an older variants, but still comparing areas is not as effective as say comparing the position of two visual elements or data length. So, it's very important to keep also these limitations in mind.