Kleiner Hartigan trees is a technique for displaying the multivariate data graphically as the 'trees' in which the values of the variables are coded into length of the terminal branches and the terminal branches have lengths which rely on the sums of the terminal branches they support. One significant feature of these trees which distinguishes them from most other compound characters, for instance, Chernoff's faces, is that an attempt is made to get rid of the arbitrariness of assignment of the variables by performing the agglomerative hierarchical cluster analysis of variables and using the resultant dendrogram as the foundation tree.