| 54 | } |
| 55 | |
| 56 | ~Node() |
| 57 | { |
| 58 | delete entry; |
| 59 | delete queue; |
| 60 | |
| 61 | // delete all child nodes |
| 62 | if (!children.empty()) { |
| 63 | Node *node = children.head; |
| 64 | Node *next = nullptr; |
| 65 | while (node) { |
| 66 | next = node->link.next; |
| 67 | children.remove(node); |
| 68 | delete node; |
| 69 | node = next; |
| 70 | } |
| 71 | } |
| 72 | } |
| 73 | |
| 74 | Node(const Node &) = delete; |
| 75 | Node &operator=(const Node &) = delete; |