About: Cartesian tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Cartesian tree Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Plant, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, a Cartesian tree is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems. The Cartesian tree for a sequence may be constructed in linear time using a stack-based algorithm for finding all nearest smaller values in a sequence.

Attributes	Values
rdf:type	plant
rdfs:label	Cartesian tree (en)
rdfs:comment	In computer science, a Cartesian tree is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems. The Cartesian tree for a sequence may be constructed in linear time using a stack-based algorithm for finding all nearest smaller values in a sequence. (en)
sameAs	Cartesian tree Cartesian tree
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:Citation dbt:For dbt:Harvtxt dbt:Main_article dbt:Refbegin dbt:Refend dbt:Reflist dbt:Sfnp dbt:Sorting
Subject	Binary trees Sorting algorithms
Link from a Wikipage to an external page	http://citeseer.ist.psu.edu/seidel96randomized.html http://www.cs.sunysb.edu/~bender/pub/lca.ps
thumbnail	wiki-commons:Special:FilePath/Cartesian_tree.svg?width=300
foaf:depiction
gold:hypernym	Tree
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Cartesian_tree?oldid=1073229766&ns=0
Wikipage page ID	15843635 (xsd:integer)
page length (characters) of wiki page	22349 (xsd:nonNegativeInteger)
Wikipage revision ID	1073229766 (xsd:integer)
Link from a Wikipage to another Wikipage	Logarithm Priority queue Ultrametric space All nearest smaller values Binary heap Binary search algorithm Binary search tree Binary tree Selection sort Widest path problem Three-dimensional graph Binary trees Sorting algorithms Potential method Linear search Sorting algorithm Time complexity Communications of the ACM Computer science Minimum spanning tree Parallel algorithm SIAM Journal on Computing Data structure Permutation Heap (data structure) Heapsort Treap Tree rotation Tree traversal Eulerian path Lowest common ancestor Stack (abstract data type) Merge algorithm Path graph Lecture Notes in Computer Science Random binary tree Range minimum query Range searching
has abstract	In computer science, a Cartesian tree is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems. The Cartesian tree for a sequence may be constructed in linear time using a stack-based algorithm for finding all nearest smaller values in a sequence. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Cartesian_tree
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Adaptive heap sort Adaptive sort All nearest smaller values Best, worst and average case Binary search tree Cartesian Jean Vuillemin Message Passing Interface List of data structures Comparison sort Heapsort Lowest common ancestor
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Cartesian_tree

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software