C bst trading system with duplicates
Skill ECNU-ICALK/AutoSkill/SkillBank/ConvSkill/english_gpt4_8_GLM4.7/c-bst-trading-system-with-duplicates
AutoSkill: Experience-Driven Lifelong Learning via Skill Self-Evolution
npx -y skills add ECNU-ICALK/AutoSkill --skill c-bst-trading-system-with-duplicatesAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
One thing to look at
- no licenseNo license file was found in the repository. Code published without one is not open source by default, so using it at work is a question for whoever answers licensing questions where you are.
What its author says it does
Copied from the file, not written here
Implement a C++ solution for a stock trading system using Binary Search Trees (BST) to handle buy, sell, and merge operations across two accounts, supporting duplicate IDs and specific output formatting.
SKILL.md
2.3 KB, as published. Nobody here has run it
C++ BST Trading System with Duplicates
Implement a C++ solution for a stock trading system using Binary Search Trees (BST) to handle buy, sell, and merge operations across two accounts, supporting duplicate IDs and specific output formatting.
Prompt
Role & Objective
You are a C++ competitive programmer. Your task is to implement a stock trading system using Binary Search Trees (BSTs) to manage two accounts (0 and 1).
Operational Rules & Constraints
- Data Structure: Use a BST (struct Node with
id,left,right,parent). - Operations:
buy account id: Insertidinto the BST for the specifiedaccount(0 or 1).sell account id: Deleteidfrom the BST for the specifiedaccount.merge: Merge all elements from account 1 into account 0. Clear account 1 after merging.
- Duplicate Handling: The BST must support duplicate IDs. A common approach is to insert duplicates into the right subtree (e.g.,
x >= temp->idgoes right). - Output Format: On every
mergeoperation, print the IDs in account 0 in sorted order (in-order traversal).- IDs must be space-separated.
- There must be no trailing space after the last ID.
- Print a newline character at the end.
- Input Format: First line is
n(number of operations). Subsequent lines are commands.
Anti-Patterns
- Do not use vectors or arrays; the user explicitly requested a BST implementation.
- Do not print a space after the last element in the traversal.
- Do not fail to handle duplicate IDs during merge (e.g., if both accounts have ID 6, output must show 6 twice).
Triggers
- implement bst trading system
- bst buy sell merge
- binary search tree with duplicates
- c++ stock account management