Download presentation
Presentation is loading. Please wait.
1
14 33 23.parent.rightnext.leftnext.lefttree.righttree Class Cell { Cell *lefttree, *righttree, *leftnext, *rightnext, *parent; TreeObject *object; Cell (TreeObject *obj, Cell *lnx, Cell *prt) { parent = prt; leftnext = lnx; object = obj; rightnext = righttree = lefttree = NULL; } };
2
.tail NULL.head
3
14.tail NULL.head NULL TreeObject *t = new IntegerObject(14);... if (head == NULL) { head = tail = new Cell(t, NULL, NULL); }
4
14.tail.head
5
14.tail.head 13 TreeObject *t = new IntegerObject(13);... if (head == NULL) { head = tail = new Cell(t, NULL, NULL); } else if (tail->lefttree == NULL) { if (tail->leftnext == NULL) { tail->lefttree = new Cell(...
6
14.tail.head 13 TreeObject *t = new IntegerObject(13);... if (head == NULL) { head = tail = new Cell(t, NULL, NULL); } else if (tail->lefttree == NULL) { if (tail->leftnext == NULL) { tail->lefttree = new Cell(t, tail, tail);...
7
14.tail.head 13 TreeObject *t = new IntegerObject(13);... if (head == NULL) { head = tail = new Cell(t, NULL, NULL); } else if (tail->lefttree == NULL) { if (tail->leftnext == NULL) { tail->lefttree = new Cell(t, tail, tail); tail->rightnext = tail->lefttree; }
8
14 34 33 2335 55 89 54 12 31.head.tail.last Cell *last = tail->lefttree;
9
14 34 33 2335 55 89 54 12 31.head.tail 13.last tail->righttree = new Cell(t,...
10
14 34 33 2335 55 89 54 12 31.head.tail 13.last.tail->righttree = new Cell(t, last, tail);
11
14 34 33 2335 55 89 54 12 31.head.tail 13.last last->rightnext = tail->righttree;
12
14 34 33 2335 55 89 54 12 31.head.tail 13.last.tail = tail->rightnext;
13
14 34 33 2335 55 89 54 12 31.head.tail 13
14
14 34 33 2335 55 89 54 12 31.head.tail 13.h.h.h = tail->leftnext->righttree;
15
14 34 33 1335 55 89 54 12 31.head.tail 23.h TreeObject *obj = h->object; h->object = h->parent->object; h->parent->object = obj;
16
14 34 33 1335 55 89 54 12 31.head.tail 23.h.h H = h->parent;
17
13 34 33 1435 55 89 54 12 31.head.tail 23.h
18
13 34 33 1435 55 89 54 12 31.head.tail 23.h
19
13 34 33 1435 55 89 54 12 34.head.tail 23.last.last = tail->leftnext->righttree;
20
13 34 33 1435 55 89 54 12 34.head.tail 23 25.last.tail->lefttree = new Cell(t,...
21
13 34 33 1435 55 89 54 12 34.head.tail 23 25.last.tail->lefttree = new Cell(t, last, tail);
22
13 34 33 1435 55 89 54 12 34.head.tail 23 25.last.last->rightnext = tail->lefttree;
23
13 34 33 1435 55 89 54 12 31.head.tail 23 25
24
13 34 33 1435 55 89 54 12 31.head.tail 23 25.h
25
13 34 33 1425 55 89 54 12 31.head.tail 23 35.h
26
13 34 33 1425 55 89 54 12 31.head.tail 23 35.h
27
13 25 33 1434 55 89 54 12 31.head.tail 23 35.h
28
13 25 33 1434 55 89 54 12 31.head.tail 23 35.h
29
13 25 33 1434 55 89 54 12 31.head.tail 23 35
Similar presentations
