Draft:Golubev's tree (data structure)

Review waiting, please be patient.

This may take 3 months or more, since drafts are reviewed in no specific order. There are 2,857 pending submissions waiting for review.

If the submission is accepted, then this page will be moved into the article space.
If the submission is declined, then the reason will be posted here.
In the meantime, you can continue to improve this submission by editing normally.

Where to get help

If you need help editing or submitting your draft, please ask us a question at the AfC Help Desk or get live help from experienced editors. These venues are only for help with editing and the submission process, not to get reviews.
If you need feedback on your draft, or if the review is taking a lot of time, you can try asking for help on the talk page of a relevant WikiProject. Some WikiProjects are more active than others so a speedy reply is not guaranteed.

How to improve a draft

Wikipedia:Contributing to Wikipedia – a basic overview on how to edit Wikipedia.
Help:Wikitext – how to use the markup
Help:Referencing for beginners – how to include references
Wikipedia:Article development – how to develop your article
Wikipedia:Writing better articles – how to improve your article
Wikipedia:Verifiability – make sure your article includes reliable third-party sources

You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article.

Improving your odds of a speedy review

To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags.

Add tags to your draft

Editor resources

Easy tools: Citation bot (help) | Advanced: Fix bare URLs

Reviewer tools

Instructions · What links here · Golubev's tree (data structure) (talk: + · bio) · (log) · Copyvios report · reFill · Citation Bot · (Search: Google, Wikipedia) · Submitted 43 days ago by Arthur Golubev 1985 (talk: D · +) · Last edited 43 days ago by Arthur Golubev 1985

Golubev's tree is data structure of the following: every link contains two values which can be either pointers or naught values: if a link has a marking zero-value descender the first value points to the marking zero-value descender link and in another case is naught value, if a link has a marking one-value descender the second value points to that marking one-value descender and in another case is naught value and links are joined so that link-by-link paths link-by-link bit-by-bit represents bits presentation of values.

Without modifications such data structure is efficient for storing collections, if in links which potentially are terminal for a value to add flags whether the link is terminal for a value or not and space for a value then is efficient for storing dictionaries and is efficient for ordering elements (it requires only putting values into the tree and reading in either zero-first or one-first depth-first order them).

Arthur Golubev (Arthur Golubev 1985) first time published code with using the data structure which demonstrates idea of ordering using this data structure in 2025-02-26 in public repository services github.com (https://github.com/ArthurGolubev1985/FastOrderingIdeaDemo), codeberg.org (https://codeberg.org/ArthurGolubev1985/FastOrderingIdeaDemo) ang gitflic.ru (https://gitflic.ru/project/arturische/fastorderingideademo).