Abstract
Encoding the shape of a binary tree is a basic step in a number of algorithms in integrated circuit design, automated theorem proving, and game playing. We propose cost-optimal parallel algorithms to solve the binary tree encoding/decoding problem. Specifically, we encode the relevant shape information of an n-node binary tree in a 2n bitstring. Conversely, given an arbitrary 2n bitstring we reconstruct the shape of the corresponding binary tree, if such a tree exists. All our algorithms run in O (log n) time using O (n/log n) processors in the EREW-PRAM model of computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
