Results 81 to 90 of about 68,741 (157)
Comparing Leaf and Root Insertion
South African Computer Journal, 2010 We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations.
Jaco Geldenhuys, Brink van der Merwe
doaj
Lossless Compression of Binary Trees with Correlated Vertex Names. [PDF]
IEEE Trans Inf Theory, 2018 Magner A, Turowski K, Szpankowski W.
europepmc +1 more source
The geometry of independence tree models with hidden variables [PDF]
, 2010 In this paper we investigate the geometry of undirected discrete graphical models of trees when all the variables in the system are binary, where leaves represent the observable variables and where the inner nodes are unobserved.
Zwiernik, Piotr, Smith, J. Q.
core
Generation of Unordered Binary Trees
, 2004 International audienceA binary unordered tree is a tree where each internal node has two children and the relative order of the subtrees of a node is not important (i.e.
Effantin, Brice
core +2 more sources
Iterative Formulas for Enumerating Binary Trees
Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for
ウシジマ, カズオ +3 more
core
Untangling binary trees via rotations
, 2008 In this paper we present a polynomial time algorithm for finding the shortest sequence of rotations that converts one binary tree into another when both binary trees are of a restricted form.
Joan M. Lucas
core
Characterization of binary trees
In "Level Number Sequences for Trees" Flagotet and Prodinger investigate the problem of counting the number of level number sequences associated to binary trees of $n$ binary nodes. I convert this problem into terms of exterior nodes or "leaves" and leaf
Brandstetter, Griffin
core
Enumeration of Binary Trees and Universal Types*
, 2004 Binary unlabeled ordered trees (further called binary trees) were studied at leastsince Euler, who enumerated them. The number of such trees with n nodes is nowknown as the Catalan number. Over the years various interesting questions about the statistics
core
Phylo2Vec: A Vector Representation for Binary Trees. [PDF]
Syst BiolPenn MJ +5 more
europepmc +1 more source
Pseudorandom binary functions on rooted plane trees
, 2012 International audienceIn an earlier paper the authors considered r-almost s-uniform trees, i.e. rooted planar trees T such that the root has r successors, and every other vertex has s suc- cessors.
Hubert, Pascal +2 more
core