Binary search trees test for hiring
See how candidates turn a binary search tree problem into working code.
- 35 рморм┐рмирм┐рмЯрнН
- 1рмЯрм┐ рмХрм╛рм░рнНрмпрнНрнЯ
- рмормзрнНрнЯрмо рм╕рнНрмдрм░
- рмХрнЛрмбрм┐рмВ рмХрм╛рм░рнНрмпрнНрнЯ
- рмЗрмВрм░рм╛рмЬрнАрм░рнЗ рмкрнНрм░рм╢рнНрми (рмЗрмВрм░рм╛рмЬрнА)
- рмХрнЗрммрм│ рмбрнЗрм╕рнНрмХрмЯрмкрнН
рм╕рмВрмХрнНрм╖рм┐рмкрнНрмд рмЙрмдрнНрмдрм░
The Coding: Binary Search Trees test is one browser-based programming task for intermediate software engineers, backend developers and data professionals who write code with ordered data structures. It measures whether candidates can build, search, change and walk binary search trees, with their solution run against hidden test cases.
рмПрм╣рм╛ рмХтАЩрмг рморм╛рмкрнЗ
Writing correct, working code that builds, searches, changes and walks binary search trees.
Binary search tree programming
Candidates write code to build or read a tree, then search, insert, remove, walk, or check it to produce the requested output.
рмкрнНрм░рм╢рнНрмирм░ рмзрм░рмг
рмХрнЛрмбрм┐рмВ рмХрм╛рм░рнНрмпрнНрнЯ
рмХрнНрнЯрм╛рмгрнНрмбрм┐рмбрнЗрмЯрнН: рмПрмХ рмПрмбрм┐рмЯрм░рнНтАМрм░рнЗ рмХрнЛрмбрнН рм▓рнЗрмЦрнЗ рмХрм┐рморнНрммрм╛ рмарм┐рмХрнН рмХрм░рнЗ рмПрммрмВ рмЙрмжрм╛рм╣рм░рмгрмЧрнБрмбрм╝рм┐рмХ рм╕рм╣ рмЪрм▓рм╛рмПред
рмЖрмкрмг рмжрнЗрмЦрм┐рммрнЗ: рмХрнЗрммрм│ рм╕рм┐рмгрнНрмЯрм╛рмХрнНрм╕рм░ рмЬрнНрмЮрм╛рми рмирнБрм╣рнЗрмБ, рмХрм╛рм░рнНрмпрнНрнЯрмХрнНрм╖рмо рмХрнЛрмбрнНтАМрмХрнБ рм▓рнБрмХрнНрмХрм╛рнЯрм┐рмд рмЯрнЗрм╖рнНрмЯ рмХрнЗрм╕рнНтАМрм░рнЗ рмпрм╛рмЮрнНрмЪ рмХрм░рм╛рмпрм╛рмПред
35 рморм┐рмирм┐рмЯрнНтАМрм░рнЗ 1рмЯрм┐ рмХрм╛рм░рнНрмпрнНрнЯред
рмПрм╣рм┐ рмЯрнЗрм╖рнНрмЯ рмЙрмкрмпрнБрмХрнНрмд рмнрнВрморм┐рмХрм╛рмЧрнБрмбрм╝рм┐рмХ
Software engineers and backend developers, and data engineers, data scientists or architects who write code that relies on ordered data structures.
What this task can show
Working tree operations
The task shows how a candidate implements operations such as searching, inserting, removing or walking a binary search tree, rather than only describing them.
The whole path from input to tree
The candidate first builds or reads the tree from the input, then works on it, so the hidden cases check the tree handling as well as the operation asked for.
No library tree class to lean on
The task uses integer keys and never depends on one language's built-in tree class, so candidates in each of the six languages write the same tree logic.
A modest input scope
Input sizes and tree heights are kept modest, so a correct solution passes in every supported language without special tuning.
рмкрнНрм░рмдрнНрнЯрнЗрмХ рмХрнНрнЯрм╛рмгрнНрмбрм┐рмбрнЗрмЯрнНтАМрмЩрнНрмХ рмкрм╛рмЗрмБ рмЖрмкрмг рмХтАЩрмг рмкрм╛рмЗрммрнЗ
- рм╕рмормЧрнНрм░ рмкрм░рнАрмХрнНрм╖рм╛ рм╕рморнЯрм░рнЗ рмкрм░рнАрмХрнНрм╖рм╛ рмЯрнНрнЯрм╛рммрнНтАМрм░рнЗ рм░рм╣рм┐рмерм┐рм▓рнЗ
- рмкрнЗрм╖рнНрмЯ рмХрм░рм╛рмпрм╛рмЗрмерм┐рммрм╛ рмЙрмдрнНрмдрм░ рмирм╛рм╣рм┐рмБ
- рм╕рнНрмерм┐рм░ рмЧрмдрм┐рм░рнЗ рмЙрмдрнНрмдрм░ рмжрнЗрм▓рнЗ
рм╕рнНрмХрнЛрм░рнН, рмкрнНрм░рнЛрмлрм╛рмЗрм▓рнН рмПрммрмВ Integrity Score рм╕рмЩрнНрмХрнЗрмдрмЧрнБрмбрм╝рм┐рмХ рм╕рм╛рмХрнНрм╖рм╛рмдрнНрмХрм╛рм░ рм╕рм╣рм┐рмд рмЖрмкрмг рм╕рморнАрмХрнНрм╖рм╛ рмХрм░рм┐рммрм╛ рмкрм╛рмЗрмБ рмкрнНрм░рморм╛рмг, рмХрнЗрммрнЗрм╣рнЗрм▓рнЗ рм╕рнНрн▒рнЯрмВрмЪрм╛рм│рм┐рмд рмирм┐рм╖рнНрмкрмдрнНрмдрм┐ рмирнБрм╣рнЗрмБред
рмПрм╣рм┐ рмЯрнЗрм╖рнНрмЯ рморм╛рмЧрмгрм╛рм░рнЗ рммрнНрнЯрммрм╣рм╛рм░ рмХрм░рмирнНрмдрнБ
Integrity signals and hidden cases
The code runs against hidden test cases on HireValidтАЩs servers; the cases and solutions do not reach the browser. Pastes into the editor are recorded. Each candidate receives a different set drawn from large question pools, and the browser presents one question at a time. Timing runs on the server, so reloading restores the same question with only the remaining time. HireValid can summarize signals such as time away from the test tab and pastes into answers in an Integrity Score and evidence timeline for you to review. It does not decide on its own. With candidate consent, you can add webcam photos at random moments. Read how HireValid builds tests and review the pre-employment testing guide when setting up your process.
рмЖрморнЗ AI рморм╛рмзрнНрнЯрморм░рнЗ рмармХрнЗрмЗ рмХрм┐рмкрм░рм┐ рм░рнЛрмХрнБ ┬╖ рм╕рмдрнНрнЯрмирм┐рм╖рнНрмарм╛ рм╕рмЩрнНрмХрнЗрмд
Use the score as one piece of evidence
The score is the share of hidden test cases the solution passes on this single task, so it reflects one problem rather than a broad sample. Reliability is provisional and will be reported once 200 candidates have completed it. Review the code and task evidence alongside a relevant work sample and a structured interview; do not use the score alone to make a hiring decision. For a broader view of role fit, compare it with the Software Engineer test or the Algorithms for Software Engineering test.
Structured interview prompts
How would you change your solution if the requested operation changed from searching to removing a key?
Listen for a concrete explanation of how the candidate would adapt their code and check the resulting tree and output.
What input case did you use to check your tree operations, and what did it reveal?
Look for a specific test case, the behavior it exercised, and how the candidate used the result to assess the code.
Walk me through how your code turns the given input into the requested output.
Listen for a clear account of the code's steps, including how it builds or reads the tree and performs the requested operation.
рм╕рнНрмХрнЛрм░рм┐рмВ рмУ рморм╛рмирмжрмгрнНрмб рммрнБрмЭрмирнНрмдрнБ
рмирм┐рм░рмкрнЗрмХрнНрм╖рмдрм╛ рмПрммрмВ рмЖрммрм╢рнНрнЯрмХ рм╕рнБрммрм┐рмзрм╛
Tasks are stated in plain US English with small worked examples, use only integer keys and neutral settings, and do not depend on any one language's library tree class, so candidates in any of the six languages solve the same problem. Input sizes and tree heights are kept modest so that a correct solution passes in every language without special tuning.
рмпрнЗрмХрнМрмгрм╕рм┐ рмкрнНрм░рм╛рм░рнНрмернАрмЩрнНрмХрнБ рмЖрммрм╢рнНрнЯрмХ рм╕рнБрммрм┐рмзрм╛ рмнрм╛рммрнЗ рмЕрмдрм┐рм░рм┐рмХрнНрмд рм╕рморнЯ рмжрнЗрмЗрмкрм╛рм░рм┐рммрнЗред рмлрм│рм╛рмлрм│ рмЬрмгрнЗ рммрнНрнЯрмХрнНрмдрм┐рмЩрнНрмХ рм╕рморнАрмХрнНрм╖рм╛ рмкрм╛рмЗрмБ рмЖрмзрм╛рм░ рморм╛рмдрнНрм░; рмПрм╣рм╛ рмХрнЗрммрнЗ рммрм┐ рм╕рнНрн▒рнЯрмВрмЪрм╛рм│рм┐рмд рмирм┐рм╖рнНрмкрмдрнНрмдрм┐ рмирнБрм╣рнЗрмБред
Provisional: the score is the share of hidden test cases the solution passes on a single task, so it reflects one problem rather than a broad sample. Reliability is reported once 200 candidates have completed it.
рмкрм░рнАрмХрнНрм╖рм╛рм░ рммрм┐рммрм░рмгрнА
One programming task built around binary search trees, solved in a browser code editor and run against hidden test cases. The candidate builds or reads a tree from the input, then searches, inserts, removes, walks or checks it to produce the asked-for output. Candidates may write their solution in Python, JavaScript, Java, C#, C++ or Go.
- рмкрнНрм░рм╢рнНрмирмЧрнБрмбрм╝рм┐рмХ рмЗрмВрм░рм╛рмЬрнАрм░рнЗ рмЕрмЫрм┐ред
- рмЕрмирнБрмормдрм┐рмкрнНрм░рм╛рмкрнНрмд рм╕рм╣рм╛рнЯрмХ рм╕рм╛рмзрми: рм░рмлрнН рмХрм╛рмЧрмЬред
- рм╕рморнЯ-рмирм┐рм░рнНрмжрнНрмзрм╛рм░рм┐рмд рмкрм░рнАрмХрнНрм╖рм╛ рмкрнВрм░рнНрммрм░рнБ 10 рморм┐рмирм┐рмЯрнНтАМрм░рнЗ 1рмЯрм┐ рмЕрмнрнНрнЯрм╛рм╕ рмХрм╛рм░рнНрмпрнНрнЯред
- рмбрнЗрм╕рнНрмХрмЯрмкрнН рмХрм┐рморнНрммрм╛ рм▓рм╛рмкрмЯрмкрнН рмХрморнНрмкрнНрнЯрнБрмЯрм░рм░рнЗ рмжрм┐рмЖрмпрм╛рмПред
Python, JavaScript, Java, C#, C++, Go рм╕рнЗрморм╛рмирмЩрнНрмХ рморм╛рм▓рм┐рмХрмЩрнНрмХрм░ рмЯрнНрм░рнЗрмбрнНтАМрморм╛рм░рнНрмХред HireValid рм╕рнЗрморм╛рмирмЩрнНрмХ рм╕рм╣ рмЬрмбрм╝рм┐рмд рмирнБрм╣рнЗрмБ рмХрм┐рморнНрммрм╛ рм╕рнЗрморм╛рмирмЩрнНрмХ рмжрнНрн▒рм╛рм░рм╛ рм╕рморм░рнНрмерм┐рмд рмирнБрм╣рнЗрмБред
рммрм╛рм░рморнНрммрм╛рм░ рмкрмЪрм░рм╛рмпрм╛рмЙрмерм┐рммрм╛ рмкрнНрм░рм╢рнНрми
How does the Coding: Binary Search Trees test stay fair across programming languages?+
The task is stated in plain US English with small worked examples, uses integer keys and neutral settings, and does not depend on any one language's library tree class. Candidates in any of the six languages solve the same problem, and modest input sizes and tree heights let a correct solution pass in each one.
What can candidates use during the Coding: Binary Search Trees test?+
Candidates may use scratch paper, which helps when sketching a tree before an insert or a removal. The 35-minute test needs a computer and has one coding task in a browser code editor.
Is there a practice set for the Coding: Binary Search Trees test?+
Yes. The practice set has one question and takes 10 minutes. It lets candidates get familiar with the editor and the format before the scored task, which asks for code that works with binary search trees and is run against hidden test cases.
Which candidates is the Coding: Binary Search Trees test designed for?+
It is an intermediate test for software engineers and backend developers, as well as data engineers, data scientists and architects who write code that relies on ordered data structures. Use it when that kind of coding is part of the role, and read the code alongside other hiring evidence.
рм╕рморнНрммрмирнНрмзрм┐рмд рмкрм░рнАрмХрнНрм╖рм╛
рмХрнЛрмбрм┐рмВ: рммрм╛рмЗрмирм╛рм░рм┐ рмЯрнНрм░рм┐
35 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБ.NET
10 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБGitHub
10 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБрмЕрммрмЬрнЗрмХрнНрмЯ рмУрм░рм┐рмПрмгрнНрмЯрнЗрмбрнН рмкрнНрм░рнЛрмЧрнНрм░рм╛рморм┐рмВ
10 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБрм╕рнБрм╕рмВрмЧрмарм┐рмд рмХрнЛрмбрнН
10 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБрмХрнЛрмбрм┐рмВ: рмЖрм▓рмЧрнЛрм░рм┐рмжрморнН, рмкрнНрм░рм╛рм░рморнНрмнрм┐рмХ рм╕рнНрмдрм░
15 рморм┐рмирм┐рмЯрнН, Programming рмжрмХрнНрм╖рмдрм╛
рмЕрмирнБрм╕рмирнНрмзрм╛рми рмХрм░рмирнНрмдрнБрмЖрмкрмгрмЩрнНрмХ рмкрм░рммрм░рнНрмдрнНрмдрнА рмирм┐рмпрнБрмХрнНрмдрм┐рм░рнЗ рмХрнЛрмбрм┐рмВ: рммрм╛рмЗрмирм╛рм░рм┐ рм╕рм░рнНрмЪрнНрмЪ рмЯрнНрм░рм┐ рмЯрнЗрм╖рнНрмЯ рммрнНрнЯрммрм╣рм╛рм░ рмХрм░рмирнНрмдрнБ
Free рм╕рм╣рм┐рмд рмкрнНрм░рмдрнНрнЯрнЗрмХ рмкрнНрм▓рм╛рмирнНтАМрм░рнЗ рмкрнВрм░рм╛ test library рмЙрмкрм▓рммрнНрмз рмЕрмЫрм┐ред