Published Paper Details:

Abstract: This paper introduces a new invention which is called as the V-Tree by the author. As the name implies it is named after the geometrical shape of the English alphabet �V�. Given the great success of recursive nature of H-Trees, it was inspired to invent another Tree which we call it a V-Tree. The basic problem with H-Tree and C-Tree is they have no hierarchical basis to visualize the binary tree. The main objective of this work is to design a set of v-Tree with suitable grammar in L-systems which visually implies the hierarchy. H-Trees which are used for clock pulse distribution in VLSI design, fills a space which is bound by a rectangle. We demonstrate the flexibility of V-Trees which can be bound in a rectangle as well as in a trapezoid which is an advantage in VLSI design in a trapezoidal circuit board. Similarly, these Trees can be visualized as a layout for graph drawing of binary trees with trapezoidal boundaries.