If you want to attend this dojo, please vote by reacting with š in the issue.
Goals:
Revisit binary tree data structure and apply it to a search
KD-Tree and quadtrees;
Tools Required:
An C++ IDE(I am going to use CLion)
Knowledge Required:
You need to know about C++ basic syntax
Pointers and structs;
Timeline Structure
Introduction (5 minutes): The facilitator introduces the coding dojo and the coding challenge for the session.
Warm-up exercise (10 minutes): Code a basic nod struct to be used in the binary tree. It should contain the data and the left and right pointers to the children node;
Coding challenge (60 minutes): Code a Tree based algorithm such as a KD-Tree or a Quadtree.
Review and discussion (15 minutes): Participants share their solutions and discuss the various approaches taken to solve the challenge.
Retrospective (10 minutes): Participants reflect on the session and provide feedback on what went well and what could be improved for future sessions.
Closing (5 minutes): The facilitator concludes the session and thanks the participants for their contributions.
Tree Data structures and algorithms for games
If you want to attend this dojo, please vote by reacting with š in the issue.
Timeline Structure