Quick and Efficient Algorithm to Compare Trees


Sowjanya M, Dr. Kiran V.
Dept. of Electronics and Communication, R.V College of Engineering, Bangalore, India.


The tree is an important data structure in computer science and it finds its applications in various fields right from representing hierarchical data to implementing faster search algorithms or even in compiler design. This paper proposes a simple method to visualize the differences and similarities between any two trees. The result of the comparison is known as the Difference Tree which provides a graphical notation to intuitively understand the differences.