A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree (Q2923974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree |
scientific article; zbMATH DE number 6364507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree |
scientific article; zbMATH DE number 6364507 |
Statements
3 November 2014
0 references
binary tree
0 references
lowest common ancestor
0 references
A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree (English)
0 references
0.7602487206459045
0 references
0.7257842421531677
0 references
0.717973530292511
0 references
0.7069652676582336
0 references
