A linear algorithm for copying binary trees using bounded workspace
An algorithm to copy a binary tree in linear time using bounded workspace is presented. The algorithm does not modify the original tree at any time. The copy is…
A linear algorithm for copying binary trees using bounded workspace
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved