Need a coder -- 3
Budget: $10 – $30 USD
Self-Balancing BST with Objects
This project is to research 10 professional sports teams and find the year the team was founded. Ensure that each team you chose has different years of their founding.
For each team, you'll instantiate a Team object that contains:
• A string field for the team's name
• An int field for the year the team was founded.
• You can make the fields public or use any number of setter/getters/constructors.
When you have a Team object ready, you'll insert it into a self-balancing binary search tree that you have implemented. (Do not use tree-like data types built into the language). You may use an AVL tree or a Red-Black tree. The year should be used for the BS's necessary comparisons. Add your Team objects to the tree in ascending order (start with the team with the earliest founding).
After your tree has been built, perform a breadth-first traversal (printing only team names) on your Tree. If the tree is correctly self-balancing, there should be no more than 4 levels in the tree.
This project is to research 10 professional sports teams and find the year the team was founded. Ensure that each team you chose has different years of their founding.
For each team, you'll instantiate a Team object that contains:
• A string field for the team's name
• An int field for the year the team was founded.
• You can make the fields public or use any number of setter/getters/constructors.
When you have a Team object ready, you'll insert it into a self-balancing binary search tree that you have implemented. (Do not use tree-like data types built into the language). You may use an AVL tree or a Red-Black tree. The year should be used for the BS's necessary comparisons. Add your Team objects to the tree in ascending order (start with the team with the earliest founding).
After your tree has been built, perform a breadth-first traversal (printing only team names) on your Tree. If the tree is correctly self-balancing, there should be no more than 4 levels in the tree.