Uravnotežena iskalna dvojiška drevesa - drevo AVL

diplomsko delo

Abstract

Prvo uravnoteženo iskalno dvojiško drevo je drevo AVL. Prednost tega drevesa je predvsem v hitrosti operacij iskanja, vstavljanja in brisanja, ki se izvedejo v logaritemskem času. Implementacija algoritma je bila razmeroma enostavna. Izdelali smo tri glavne razrede, ki opravljajo različne operacije nad drevesom AVL, za enostaven prikaz delovanja pa smo izdelali namizno aplikacijo.

Keywords

podatkovne strukture;dvojiška drevesa;uravnotežena drevesa;AVL drevo;rotacija;

Data

Language:	Slovenian
Year of publishing:	2014
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher:	[R. Šket]
UDC:	004.422.635.33(043.2)
COBISS:	18285334
Views:	1209
Downloads:	148
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Balanced binary search trees - AVL tree
Secondary abstract:	The AVL tree is the first balanced binary search tree. It’s advantage is mainly it’s speed during search, insert and delete operations that are performed in a logarithmic time. The implementation of the logarithm was relatively simple. We separated three main classes that perform different operations on the AVL tree and developed a desktop application for a simple demonstration.
Secondary keywords:	data structures;binary search tree;balanced tree;AVL tree;rotation;
URN:	URN:SI:UM:
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko
Pages:	VIII, 54 str.
ID:	8728938

Recommended works:

Uravnotežena iskalna dvojiška drevesa - drevo AVL

2014, diplomsko delo

Inkrementalno iskanje najbližje točke z uporabo k-d drevesa

2015, diplomsko delo

Rdeče-črna drevesa

2010, diplomsko delo univerzitetnega študijskega programa

Recognizing graph search trees

2019, no subtitle data available

Konična drevesa

2012, delo diplomskega seminarja