Talk:WAVL tree: Difference between revisions

Browse history interactively

Next edit →

Content deleted Content added

VisualWikitext

Inline

Revision as of 15:54, 5 November 2017

Computer science C‑class Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

C

This article has been rated as C-class on Wikipedia's content assessment scale.

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

I do not find the explanation of deletion clear. With AVL trees some deletes create imbalances further up the tree so Ologn rotations may be required. An example delete on a Fibonacci Tree would be useful.

Revision as of 22:03, 17 November 2015 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 223,209 edits {{WikiProject Computer science\|class=C\|importance=low}} — needs more detailed description of data structure operation to improve to class B		Revision as of 15:54, 5 November 2017 edit undo Dmcmanam (talk \| contribs) 38 edits Delete explanation could be expanded. Next edit →
Line 1:		Line 1:
	{{WikiProject Computer science\|class=C\|importance=low}}		{{WikiProject Computer science\|class=C\|importance=low}}

			I do not find the explanation of deletion clear. With AVL trees some deletes create imbalances further up the tree so Ologn rotations may be required. An example delete on a Fibonacci Tree would be useful.