Trees/LinkedTree: Difference between revisions
From charlesreid1
No edit summary |
|||
| Line 3: | Line 3: | ||
A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]]) | A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]]) | ||
This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory). | This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]). | ||
==Flags== | ==Flags== | ||
Revision as of 22:45, 10 June 2017
Linked tree class
A more generic version of the linked binary tree implementation LinkedBinTree (link: Binary Trees/LinkedBinTree)
This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see Trees/ADT).