Skip to search formSkip to main contentSkip to account menu

Left-child right-sibling binary tree

Known as: LCRS tree, First-child-next-sibling, LC-RS Tree 
Every multi-way or k-ary tree structure studied in computer science admits a representation as a binary tree, which goes by various names including… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Binary treeComputer scienceK-ary treeList of data structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Scribe ’ s Hand Betrays His Tongue : Diglossia Among the Ancient Maya
During the Classic period (AD 250-900), the Maya of Southeastern Mexico, Guatemala, Belize, and Western Honduras… 
2011
2011
Second Circuit Panel Allows Stun Mode to Gain Compliance of Chained Protestors
2008
2008
Reliability and Performance of Mirrored Disk Organizations
Disk mirroring or redundant array of independent disk (RAID) level 1 is a popular paradigm to achieve fault-tolerance and a… 
2008
2008
A Creative Project of Urban and Suburb Library Services——Exploration and Practice of Shanghai Oriental Community's Chained InfoSpaces
This article is about the exploration and practice of Shanghai Oriental Community InfoSpaces Project(SOCIP),which has been… 
2006
2006
Pycnogonida of New Caledonia
Recording of pycnogonids from the New Caledonia region began as recently as 1977 (Child, 1977). Since then, the intensive… 
2005
2005
Organizational learning and unlearning: Transferring knowledge to greenfield versus acquisition joint ventures
This issue of organizational unlearning, which is defined as the discarding of old routines to make way for new ones, has… 
1997
1997
Multi-attribute lexicon generation by hyperlinked embedded access structure
Providing a lexicon for all possible postal addresses can support decision making for handwritten address interpretation. The… 
1976
1976
Optimal tree lists for information storage and retrieval
1975
1975
Modeling and analysis of data base organization. The doubly chained tree structure
1975
1975
Representing Graphs by Knuth Trees
ASSrRACT. By means of the :Knuth transform, arbitrary rooted trees may be represented compactly as binary trees. In this paper it… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)