Binary Trees/Implementation Notes: Difference between revisions
From charlesreid1
(Created page with "IMPORTANT NOTES: * Implements interface that implements another interface * Node class is protected * Protected createNode factory method * Protected validate method * Public...") |
No edit summary |
||
| Line 1: | Line 1: | ||
=Notes= | |||
from linked binary tree concrete implementation: | |||
* Implements interface that implements another interface | * Implements interface that implements another interface | ||
* Node class is protected | * Node class is protected | ||
| Line 5: | Line 7: | ||
* Protected validate method | * Protected validate method | ||
* Public attach, remove | * Public attach, remove | ||
The biggest problem was keeping all the functionality details straight. Knowing what choices to make. | |||
* Protecting a method versus private method versus public method? | |||
* Implementing an interface versus a class? | |||
* Class within a class versus public class? | |||
* Proper protection on a private utility class? | |||
=Flags= | |||
{{TreesFlag}} | {{TreesFlag}} | ||
Latest revision as of 20:06, 11 June 2017
Notes
from linked binary tree concrete implementation:
- Implements interface that implements another interface
- Node class is protected
- Protected createNode factory method
- Protected validate method
- Public attach, remove
The biggest problem was keeping all the functionality details straight. Knowing what choices to make.
- Protecting a method versus private method versus public method?
- Implementing an interface versus a class?
- Class within a class versus public class?
- Proper protection on a private utility class?
Flags
 |
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
|