A Method for Fast Leaderboard Calculations in Massive Online Game-Based Environments

Algorithm 4

Step 1. Set the root as the current node

Step 2. Check if the current node is null, if not, proceed to step

Step 3. Traverse the right subtree by recursively calling the in-order function

Step 4. Display information of the current node

Step 5. Traverse the left subtree by recursively calling the in-order function