AVL Trees - Project Plan

• Decide on how user can access the visualizer tree

  • Maybe a dropdown for Trees > AVL Trees, Binary Search Trees etc.

  • Final UI Touch - hopefully, won’t take too long, can do once the bulk of the logic for the tree is complete

• Brush up on AVL Trees

  • Tree which rebalances itself upon insertion of a new node

• Implement all necessary operations for AVL tree, reusing code from BST

  • Insert

    • On every insert need to rebalance the tree

  • Remove

    • On every remove ned to rebalance the tree

  • Pre-order

  • Post-order

  • In-order

Tasks

• 11/03 - 16/03

  • Revising AVL trees

• 16/03 - 20/03

  • Lachlan

    • Copying over existing BST logic for insert, remove, traversal

    • If there is time, do the drop-down for AVL access

  • Aditi

    • Busy this week

• 21/03 - 24/03

  • Aditi

    • New logic for the rotation upon insertion and removal

  • Lachlan

    • Drop down / UI