PROGRAMMING рдХреМрд╢рд▓реНрдпреЗ

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

  1. 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.

  2. 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.

  3. 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.

  4. A modest input scope

    Input sizes and tree heights are kept modest, so a correct solution passes in every supported language without special tuning.

рдкреНрд░рддреНрдпреЗрдХ рдЙрдореЗрджрд╡рд╛рд░рд╛рд╕рд╛рдареА рддреБрдореНрд╣рд╛рд▓рд╛ рдХрд╛рдп рдорд┐рд│рддреЗ

рдЙрджрд╛рд╣рд░рдгрд╛рд░реНрде рдЕрд╣рд╡рд╛рд▓ (рдХрд╛рд▓реНрдкрдирд┐рдХ рдбреЗрдЯрд╛)рдХреЛрдбрд┐рдВрдЧ: рдмрд╛рдпрдирд░реА рд╕рд░реНрдЪ рдЯреНрд░реА
ренрео%рдкрд░реНрд╕реЗрдВрдЯрд╛рдЗрд▓ 62. рдмреЗрдВрдЪрдорд╛рд░реНрдХ: HireValid рдЙрдореЗрджрд╡рд╛рд░, n = репрепрем
Binary search tree programmingренрео%
Integrity ScoreрдЙрдЪреНрдЪ рд╡рд┐рд╢реНрд╡рд╛рд╕рдкрд╛рддрд│реА
  • рд╕рдВрдкреВрд░реНрдг рдЪрд╛рдЪрдгреАрджрд░рдореНрдпрд╛рди рдЪрд╛рдЪрдгреАрдЪрд╛ рдЯреЕрдм рдЙрдШрдбрд╛ рдареЗрд╡рд▓рд╛
  • рдкреЗрд╕реНрдЯ рдХреЗрд▓реЗрд▓реА рдЙрддреНрддрд░реЗ рдирд╛рд╣реАрдд
  • рд╕реНрдерд┐рд░ рдЧрддреАрдиреЗ рдЙрддреНрддрд░реЗ рджрд┐рд▓реА

рд╕реНрдХреЛрдЕрд░, рдкреНрд░реЛрдлрд╛рдЗрд▓ рдЖрдгрд┐ 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.

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

  1. 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.

  2. 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.

  3. 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.

  • рдкреНрд░рд╢реНрди рдЗрдВрдЧреНрд░рдЬреАрдордзреНрдпреЗ рдЖрд╣реЗрдд.
  • рдкрд░рд╡рд╛рдирдЧреА рдЕрд╕рд▓реЗрд▓реА рд╕рд╛рдзрдиреЗ: рдЦрд░рдбрдгреНрдпрд╛рд╕рд╛рдареАрдЪрд╛ рдХрд╛рдЧрдж.
  • рд╡реЗрд│реЗрдЪреНрдпрд╛ рдорд░реНрдпрд╛рджреЗрддреАрд▓ рдЯреЗрд╕реНрдЯрдкреВрд░реНрд╡реА 1 рд╕рд░рд╛рд╡ рдЯрд╛рд╕реНрдХ, 10 рдорд┐рдирд┐рдЯреЗ.
  • рдбреЗрд╕реНрдХрдЯреЙрдк рдХрд┐рдВрд╡рд╛ рд▓реЕрдкрдЯреЙрдк рд╕рдВрдЧрдгрдХрд╛рд╡рд░ рджрд┐рд▓реА рдЬрд╛рддреЗ.

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.

рд╕рдВрдмрдВрдзрд┐рдд рдЪрд╛рдЪрдгреНрдпрд╛

Programming рдХреМрд╢рд▓реНрдпреЗ

рдХреЛрдбрд┐рдВрдЧ: рдмрд╛рдпрдирд░реА рдЯреНрд░реА

35 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
Programming рдХреМрд╢рд▓реНрдпреЗ

.NET

10 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
Programming рдХреМрд╢рд▓реНрдпреЗ

GitHub

10 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
Programming рдХреМрд╢рд▓реНрдпреЗ

рдСрдмреНрдЬреЗрдХреНрдЯ-рдУрд░рд┐рдПрдВрдЯреЗрдб рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ

10 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
Programming рдХреМрд╢рд▓реНрдпреЗ

рд╕реНрд╡рдЪреНрдЫ рдХреЛрдб

10 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
Programming рдХреМрд╢рд▓реНрдпреЗ

рдХреЛрдбрд┐рдВрдЧ: рдЕрд▓реНрдЧреЛрд░рд┐рджрдо, рд╕реБрд░реБрд╡рд╛рддреАрдЪреА рдкрд╛рддрд│реА

15 рдорд┐рдирд┐рдЯреЗ, Programming рдХреМрд╢рд▓реНрдпреЗ

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛

рддреБрдордЪреНрдпрд╛ рдкреБрдвреАрд▓ рднрд░рддреАрд╕рд╛рдареА рдХреЛрдбрд┐рдВрдЧ: рдмрд╛рдпрдирд░реА рд╕рд░реНрдЪ рдЯреНрд░реА рдЯреЗрд╕реНрдЯ рд╡рд╛рдкрд░рд╛

Free рд╕рд╣рд┐рдд рдкреНрд░рддреНрдпреЗрдХ рдкреНрд▓реЕрдирдордзреНрдпреЗ рд╕рдВрдкреВрд░реНрдг рдЯреЗрд╕реНрдЯ рд▓рд╛рдпрдмреНрд░рд░реА рдЙрдкрд▓рдмреНрдз рдЖрд╣реЗ.

рд╣реА рдЯреЗрд╕реНрдЯ рд╡рд┐рдирд╛рдореВрд▓реНрдп рд╡рд╛рдкрд░рд╛Free рдкреНрд▓реЕрди. рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдбрдЪреА рдЧрд░рдЬ рдирд╛рд╣реА.
Free рдкреНрд▓реЕрди. рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдбрдЪреА рдЧрд░рдЬ рдирд╛рд╣реА.рд╣реА рдЯреЗрд╕реНрдЯ рд╡рд┐рдирд╛рдореВрд▓реНрдп рд╡рд╛рдкрд░рд╛

рд╕рдВрдкрд╛рджрдХреАрдп рдЯреАрдордмрджреНрджрд▓

HireValid editorial team рдиреЗ рд▓рд┐рд╣рд┐рд▓реЗрд▓реЗ рдЖрдгрд┐ рддрдереНрдпрд╛рдВрдЪреА рдкрдбрддрд╛рд│рдгреА рдХреЗрд▓реЗрд▓реЗ. рддрдкрд╛рд╕рд▓реЗрд▓реЗ рд╕реНрд░реЛрдд . рд╕рдВрдкрд╛рджрдХреАрдп рдзреЛрд░рдг рд╡рд╛рдЪрд╛.