Implemented Tail Optimization

[cangokmen]

Changed files: ART.h, ArtNode.h, .gitignore, CMakeLists.txt, README.md, run.cpp
Created files: ArtNodeNewMethods.cpp, trees/QuART_tail.h, run_experiments.sh

• ART.h: Added printTree method that pretty-prints the tree. Added verifyTailPath method that returns whether the tail path is true (can be used in QuART_tail for verification).
• ArtNode.h: Added declarations of tailInsertNodeX methods used in QuART_tail. Added printFpPath method that pretty-prints a node array.
• ArtNodeNewMethods.cpp: Implemented tailInsertNodeX functions used in QuART_tail.
• trees/QuART_tail.h: Implemented the generic tail insert.
• run_experiments.sh: Runs the benchmark experiments.
• .gitignore: Updated gitignore so that it ignores the results folder.
• CMakeList.txt: Added line to generate the run executable
• README.md: Updated README with the new changes. It explains how to run the experiments too.

[Copilot]

Pull Request Overview

This PR implements tail optimization for the QuART (Quick Adaptive Radix Tree) data structure. The tail optimization provides a fast path for insertions by tracking the rightmost path in the tree and enabling direct insertion when new keys are lexicographically greater than the current maximum.

• Adds QuART_tail class with tail optimization strategy
• Implements new tail-specific insert methods for all node types (Node4, Node16, Node48, Node256)
• Adds debugging and verification utilities for the tree structure

Reviewed Changes

Copilot reviewed 8 out of 9 changed files in this pull request and generated 6 comments.

Show a summary per file

File	Description
trees/QuART_tail.h	Main implementation of QuART with tail optimization including insert logic and recursive tail insertion
ArtNodeNewMethods.cpp	Implements tailInsertNodeX methods for all node types with fast path tracking
ArtNode.h	Adds declarations for tail insert methods and debugging utilities
ART.h	Adds tree printing and tail path verification methods plus additional fast path tracking fields
run.cpp	Benchmark runner supporting different tree types with timing measurements
run_experiments.sh	Automation script for running experiments across multiple workloads
CMakeLists.txt	Adds build target for the run executable
README.md	Updates documentation with QuART variants and experiment instructions

Comments suppressed due to low confidence (1)

ArtNodeNewMethods.cpp:130

• [nitpick] The loop condition 'i < fp_path_length_old - temp_fp_path_length_old + 1' is complex and could be simplified by calculating the limit as a separate variable for better readability.

        for (unsigned i = 0; i < this->count; i++)

[ramananeesh]

LGTM