Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Doubly_chained_tree> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Doubly_chained_tree abstract "In computer science, a doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one pointing to its child and one to its parent.".
- Doubly_chained_tree wikiPageExternalLink index.htm.
- Doubly_chained_tree wikiPageID "21678520".
- Doubly_chained_tree wikiPageRevisionID "471784266".
- Doubly_chained_tree hasPhotoCollection Doubly_chained_tree.
- Doubly_chained_tree subject Category:Trees_(data_structures).
- Doubly_chained_tree comment "In computer science, a doubly chained tree is a tree data structure in which each node has two pointers. Typically, each node has one pointer pointing to its child and one pointing at the node to its right. Then the following node will have one pointing to its child and one to its parent.".
- Doubly_chained_tree label "Doubly chained tree".
- Doubly_chained_tree sameAs m.05myy_y.
- Doubly_chained_tree sameAs Q5300175.
- Doubly_chained_tree sameAs Q5300175.
- Doubly_chained_tree wasDerivedFrom Doubly_chained_tree?oldid=471784266.
- Doubly_chained_tree isPrimaryTopicOf Doubly_chained_tree.