| Display title | AVL Trees in Java |
| Default sort key | AVL Tree |
| Page length (in bytes) | 56,563 |
| Namespace ID | 0 |
| Page ID | 983620 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiMasterBot |
| Date of page creation | 03:09, 25 July 2016 |
| Latest editor | WikiMasterBot2 (talk | contribs) |
| Date of latest edit | 20:56, 20 July 2026 |
| Total number of edits | 3 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the... |
