论文信息 - A linear time and space algorithm for finding isomorphic subtrees of a binary tree - 字舞流文

A linear time and space algorithm for finding isomorphic subtrees of a binary tree

This paper shows that it is possible to find all isomorphic subtrees of a binary tree in linear time and space.

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Gary D. Knott,et al. A numbering system for binary trees , 1977, CACM.

[3] H. W. Martin,et al. A random binary tree generator , 1989, CSC '89.