Binary Tree Progress Map:
- Tree generation up to a specified value without exceeding.
- Finding and Generating the route for a value that might not have a node.
- Make an interpreter for ease-of-access to find in a tree. EX: Find the path to 100 in a Search Tree.
- Determining if a child node exists in a structured tree.
- Validation to ensure automatic generation is working properly.
- Preorder Traversal for a Binary Tree.
- User Incorporation.
- User specified BST Generation Boundaries.
- User specified search value on BST, no generation required.
- User specified search if a value exists on a tree.
- Indicate the value exists.
- Indicate the value does not exist
- Allow a more user-generated and interactive experience.
- Making a tree based off an array / list of values. Traversal.
- Generate a tree from an array of values. Needs research
- Find a value from the previously generated tree.
- insert a root at a value and generate the tree from there. Ex: Get the node for a value of 58, and start a new tree starting from there with a value of 5.
- Package different Trees as classes, and their methods. If there is overlap like traversals, or verifying existance, keep it in a shared methods file.
What comes next?
- Constant Tasks
- Constant general cleanup of unused methods.
- Searching / Generation / Algorithm Refinement.
- Defined Tasks: Related to Binary Trees
- Searching by Non-Nested Data Type
- Searching by Nested Data Type ( Arrays, Lists, HashMaps, etc... )
- Searching by field in Class, potentially.
- Other Things
- Other data structure work can go here.
- Make files for best practices, development ideas.
Topics to Research
- Self Balancing Tree.
- Balanced Tree.
- DFS / BFS.
- Insertion Methods.
- Removal Methods.
- Traversal Types and applications.
- Inorder [Left, Root, Right]
- Postorder [Left, Right, Root]
- Preorder [Root, Left, Right]
Thanks for reading. Not sure how often this will update, but I can assume it will.
Eventually.