@article{Pajoohesh_2008, title={Topological and categorical properties of binary trees}, volume={9}, url={https://ojs.upv.es/index.php/AGT/article/view/1863}, DOI={10.4995/agt.2008.1863}, abstractNote={<p>Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements. For two given algorithms A and B where the decision tree of A is more balanced than that of B, it is known that the average and worst case times of A will be better than those of B, i.e., â‚¸<sub>A</sub>(n) ≤â‚¸<sub>B</sub>(n) and T<sup>W</sup><sub>A</sub> (n)≤T<sup>W</sup><sub>B</sub> (n). Thus the most balanced and the most imbalanced binary trees play a main role. Here we consider them as semilattices and characterize the most balanced and the most imbalanced binary trees by topological and categorical properties. Also we define the composition of binary trees as a commutative binary operation, *, such that for binary trees A and B, A * B is the binary tree obtained by attaching a copy of B to any leaf of A. We show that (T,*) is a commutative po-monoid and investigate its properties.</p>}, number={1}, journal={Applied General Topology}, author={Pajoohesh, H.}, year={2008}, month={Apr.}, pages={1–14} }