Draft:Golubev's tree (data structure)
| Submission declined on 4 March 2025 by Dan arndt (talk). This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources.
Where to get help
How to improve a draft
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. Editor resources
|  |
| Submission declined on 4 March 2025 by Jolielover (talk). This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources. Declined by Jolielover 36 days ago. | |
Comment: Undeclared WP:COI - clearly WP:SELFPROMOTION. Fails WP:GNG, noting GitHub, Gitflic and Codeberg are not acceptable or reliable sources. Dan arndt (talk) 08:21, 4 March 2025 (UTC)
 | A major contributor to this article appears to have a close connection with its subject. (March 2025) |
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. Such data structure is efficient for storing collections and 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).
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).
- in-depth (not just passing mentions about the subject)
- reliable
- secondary
- independent of the subject
Make sure you add references that meet these criteria before resubmitting. Learn about mistakes to avoid when addressing this issue. If no additional references exist, the subject is not suitable for Wikipedia.