Abstract
The paper makes an extensive study on the symmetric brothers of a node in a perfect binary tree. Through proving several new properties of the symmetric brothers of a node, it reveals how the symmetric brothers and the symmetric ancestors distribute on the tree and how they are beneficial for designing a searching algorithm of special purpose. Detail mathematical reasoning and proofs are shown together with concrete examples to demonstrate the mathematical traits. The paper is helpful for designing algorithms in blind search related aspects.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
