Encyclopedia : 2 : 23 : 23H (1 articles)

---

2-3 heap
In computer science, a 2-3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2-3 tree. Time costs for some common heap operations: delete-min takes [O(log(n))] amortized timedecrease-..

 

---

From Wikipedia, the Free Encyclopedia. Article contents subject to the GNU Free Documentation License.

Search Titles

0

1

2

3

4

5

6

7

8

9

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

?