| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:RDEČE-ČRNA DREVESA
Authors:ID Cerar, Jani (Author)
ID Guid, Nikola (Mentor) More about this mentor... New window
ID Kolmanič, Simon (Comentor)
Files:.pdf UNI_Cerar_Jani_2010.pdf (992,93 KB)
MD5: 8F1689D37F8F744C32D1B33716EB3C4C
PID: 20.500.12556/dkum/fac1ee6c-159f-445b-b428-6d79cdf78d8d
 
Language:Slovenian
Work type:Bachelor thesis/paper
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Rdeče-črno drevo je uravnoteženo binarno iskalno drevo, kar nam zagotavlja učinkovito iskanje. Nad rdeče-črnimi drevesi lahko izvajamo operacije iskanja, vstavljanja in brisanja. Rdeče-črna drevesa se uporabljajo tam, kjer potrebujemo hitro iskanje, vstavljanje in brisanje.
Keywords:rdeče-črno drevo, binarno iskalno drevo, rotacija
Place of publishing:Maribor
Publisher:[J. Cerar]
Year of publishing:2010
PID:20.500.12556/DKUM-15926 New window
UDC:004.928(043.2)
COBISS.SI-ID:14746134 New window
NUK URN:URN:SI:UM:DK:ZNBAZOAH
Publication date in DKUM:20.12.2010
Views:2851
Downloads:325
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:RED-BLACK TREES
Abstract:Red-black tree is a balanced binary tree, which this provides us an efficient search. With red-black trees we can do operations such as inserting, deleting, or finding values. We use red-black trees when we need fast search, insertion, and deletion.
Keywords:red-black trees, binary trees, tree rotation


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica