About: Binary search tree

Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Binary search tree Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

A binary search tree is a binary tree where in each node: * The left subtree contains only nodes with keys less than the node's key (the "data"/"value" of the node). * The right subtree contains only nodes with keys greater than the node's key. * Both subtrees are also binary search trees. It follows that each key is distinct. Binary search trees are especially useful in constructing other data structures such as sets, multisets and associative arrays.

Attributes	Values
rdfs:label	Binary search tree
rdfs:comment	A binary search tree is a binary tree where in each node: * The left subtree contains only nodes with keys less than the node's key (the "data"/"value" of the node). * The right subtree contains only nodes with keys greater than the node's key. * Both subtrees are also binary search trees. It follows that each key is distinct. Binary search trees are especially useful in constructing other data structures such as sets, multisets and associative arrays.
sameAs	dbr:Binary_search_tree
dcterms:subject	Data structures
abstract	A binary search tree is a binary tree where in each node: * The left subtree contains only nodes with keys less than the node's key (the "data"/"value" of the node). * The right subtree contains only nodes with keys greater than the node's key. * Both subtrees are also binary search trees. It follows that each key is distinct. Binary search trees are especially useful in constructing other data structures such as sets, multisets and associative arrays.

OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software