Results 21 to 30 of about 61,399 (161)
Supernode Binary Search Trees [PDF]
International Journal of Foundations of Computer Science, 2003 Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established.
Haejae Jung, Sartaj Sahni
openaire +1 more source
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +1 more source
Theory exploration of binary trees [PDF]
2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY), 2015 The construction of a theory for binary trees is presented, based on the systematic exploration of the properties necessary for the proof-based synthesis and certification of sorting algorithms for binary trees. The process is computer supported, being realised in the frame of the Theorema system, with some additional proofs in Coq required for ...
Isabela Dramnesc +2 more
openaire +2 more sources
The height of q-Binary Search Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
Michael Drmota, Helmut Prodinger
doaj +3 more sources
On Succinct Representations of Binary Trees [PDF]
Mathematics in Computer Science, 2017 Journal version of part of COCOON 2012 ...
Pooya Davoodi +2 more
openaire +3 more sources
Grid Drawings of Binary Trees: An Experimental Study
Journal of Graph Algorithms and Applications, 2008 In this paper we consider the class of binary trees and present the results of a comprehensive experimental study on the four most representative algorithms for drawing trees, one for each of the following tree-drawing approaches: Separation-Based, Path-
Adrian Rusu, Confesor Santiago
doaj +1 more source
The Cambrian Hopf Algebra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees.
G. Chatel, V. Pilaud
doaj +1 more source
The algebra of binary trees is affine complete [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet containing at ...
Andre Arnold +3 more
doaj +1 more source
Topological and categorical properties of binary trees
Applied General Topology, 2008 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.
H. Pajoohesh
doaj +1 more source
Combinatorics of non-ambiguous trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault ...
Jean-Christophe Aval +3 more
doaj +1 more source