File:AVL-tree-delete.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file(SVG file, nominally 2,112 × 580 pixels, file size: 47 KB)

Summary

Description
English: Removing an element with two children from a binary search tree as proposed by T.Hibbard (1962). Created by User:Dcoetzee. Adapted for balanced trees by User:Nomen4Omen; unbalanced binary trees may have subtrees at nodes B and F.
Date
Source commons
Author Nomen4Omen
Permission
(Reusing this file)
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Germany license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Other versions Binary search tree delete.svg

Licensing

I, the copyright holder of this work, hereby publish it under the following licenses:
GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International, 3.0 Unported, 2.5 Generic, 2.0 Generic and 1.0 Generic license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
You may select the license of your choice.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

29 May 2016

image/svg+xml

cd7c08ecfe80ef2a1c474ea7f2a160a0ca1eb12a

47,903 byte

580 pixel

2,112 pixel

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current19:15, 12 August 2021Thumbnail for version as of 19:15, 12 August 20212,112 × 580 (47 KB)Nomen4Omenblack arrows smaller, red arrow zigzag
11:37, 29 May 2016Thumbnail for version as of 11:37, 29 May 20162,106 × 564 (51 KB)Nomen4OmenAll letters non-bold.
10:34, 29 May 2016Thumbnail for version as of 10:34, 29 May 20162,106 × 564 (45 KB)Nomen4OmenOnly 2 steps needed.
10:31, 29 May 2016Thumbnail for version as of 10:31, 29 May 20162,877 × 564 (51 KB)Nomen4Omen{{Information |Description ={{en|1=Demonstrates the process of removing an element with two children from a binary search tree. Created by User:Dcoetzee in Illustrator. Adapted for AVL tree by User:Nomen4Omen.}} |Source =commons |Aut...
No pages on the English Wikipedia use this file (pages on other projects are not listed).

Global file usage

The following other wikis use this file:

Metadata