Skip to content

Binary Search Tree Implementation

Jump to bottom
unmeshvrije edited this page Nov 25, 2019 · 1 revision

Welcome everyone!

In this project, we will implement the C++ class for Binary Search Tree.

Because of the number of participants, we will follow certain protocols and the best practices of Git. Including @unmeshvrije, we are 15 people. We divide all teachers from Mosul university into 7 groups. Each group contains two people.

Following are the groups (I have chosen them randomly). I apologize in advance for omitting the respectable titles (like Dr., Mr., etc.). I would like all of us to be friends and titles introduce hidden hierarchy.

  1. Mohammed Maher (Code) - Abdoulrhman Mohanned (Review/Test)
  2. Omar Inaam (Code) - Mohammad Aldabbagh (Review/Test)
  3. Abdullah S. Mahmoud (Code) - Ansam Osamah (Review/Test)
  4. Shamil-Al-Ameen (Code) - Abdullah.H.Ahmed (Review/Test)
  5. Omar Al Saffar (Code) - Taha (Review/Test)
  6. Omar Alhabeeb (Code) - Mohanad (Review/Test)
  7. Yousif Alneamy (Code) - Yasser Mohammad (Review/Test)

The roles (Code) and Review/Test

In every group, one person takes the role of coder and the other person will take the role of Reviewer or Tester. For example, in the group 2, if Omar Inaam writes the function that adds a node to the binary search tree, then Mohammad Aldabbagh will review the code and provide test cases.

Clone this wiki locally