| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:BINOMSKE KOPICE
Authors:ID Zagorc, Andrej (Author)
ID Guid, Nikola (Mentor) More about this mentor... New window
ID Kolmanič, Simon (Comentor)
Files:.pdf UNI_Zagorc_Andrej_2011.pdf (2,02 MB)
MD5: 031195B1AB4E5636986686136E5DBCA5
PID: 20.500.12556/dkum/b7513396-d81c-4f4e-8557-9e55a3348c0d
 
Language:Slovenian
Work type:Bachelor thesis/paper
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Binomska kopica je podatkovna struktura, ki je sestavljena iz več binomskih dreves. Za binomska drevesa znotraj binomske kopice velja lastnost minimalnih kopic. Uporablja se za hitro iskanje podatkov. Binomsko kopico ponazorimo kot vozlišče, ki vsebuje ključ, kazalec na očeta, sina in sorodnika ter stopnjo vozlišča. Nad binomskimi kopicami lahko izvajamo operacije iskanja, vrivanja, brisanja in spreminjanja. Časovna zahtevnost glede na dvojiško drevo je boljša, predvsem ko pride do uporabe operacije unije.
Keywords:binomska kopica, binomsko drevo, podatkovna struktura
Place of publishing:Maribor
Publisher:[A. Zagorc]
Year of publishing:2011
PID:20.500.12556/DKUM-20330 New window
UDC:004.45:004.6(043.2)
COBISS.SI-ID:15659286 New window
NUK URN:URN:SI:UM:DK:V2MP5AX0
Publication date in DKUM:26.09.2011
Views:2157
Downloads:151
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:BINOMIAL HEAPS
Abstract:A binomial heap is a data structure made of a list of binomial trees. Binomial trees in the binomial heap obey the min-heap property. They are used for quick data search. The binomial heap is represented by the nodes that contain a key, pointers to its parent, its child, and its sibling, and a degree. With the binomial heap we can do operations such as searching, deleting, and changing. A running time for the binomial heap is better a than running time for binary the heap, specially, when we use a union operation.
Keywords:binomial heap, binomial tree, data structure


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