Lowest Common Ancestor of a Binary Tree: which companies ask it and how to practise

Lowest Common Ancestor of a Binary Tree is a Medium problem that 22 companies are reported to ask. This page shows who, how often and how recently, what the question tests, and how to practise it out loud with an interviewer who asks follow-ups. We link to the original problem statement instead of copying it.

Which companies ask Lowest Common Ancestor of a Binary Tree?

Public company lists attribute Lowest Common Ancestor of a Binary Tree, a Medium problem, to 22 companies. The most frequent askers are Airwallex, Wix and Meta. 5 reports are from the last six months. It mainly tests tree, depth-first search and binary tree. Use this as a practice guide, not a promise.

Practise this kind of question aloud

Who asks Lowest Common Ancestor of a Binary Tree

22 companies appear in the public lists for this question. By how often each is reported: Airwallex (very often), Wix (very often), Meta (very often), Atlassian (often), Amazon (often), Lucid (often), BitGo (often), Adobe (often), Intel (often) and LinkedIn (often), and 12 more. 5 of them were reported in the last six months, Meta, Amazon and BlackRock among them.

These are candidate reports collected in public lists, not statements from the companies. They are a good guide to what to practise and a poor guide to what you will be asked: interviewers change questions, and the same company asks different questions by team and level. Last reviewed 25 October 2026.

What Lowest Common Ancestor of a Binary Tree tests

It is rated Medium, which is the level most interviews are built around: expect to talk through two approaches, pick one, code it cleanly, and answer a cross-question on an edge case or a change to the constraints.

Tree questions are usually a traversal with a small piece of state carried down or returned up. Say which one you chose.

Depth-first search follows one path to its end before backing up. Say how you mark visited nodes and what the recursion depth could be.

Binary tree questions are a traversal with state carried down or returned up. Say which order (pre, in, post, level) the problem needs.

How to practise it

Do not just solve it silently. In a real interview you explain the approach before you code, write while you talk, and defend the solution to follow-ups. Set a timer, say the brute force and its cost first, then improve it, and finish by stating the time and space complexity and two edge cases you tested.

On giveinterview you can take this kind of question as a spoken interview: the AI interviewer opens with the problem, watches you code, asks cross-questions and ends with a scorecard. Your first 3 single-question interviews are free for life, every interview report is free, and a new account also gets 6 welcome credits.

Read the original statement here: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ (opens the publisher's page). The statement is theirs; we do not reproduce it.

Questions to practise next

If you can solve Lowest Common Ancestor of a Binary Tree, try these next, chosen because they share its main topic and many of the same companies: Two Sum (Easy), LRU Cache (Medium), Merge Intervals (Medium), Valid Parentheses (Easy), Longest Substring Without Repeating Characters (Medium) and Best Time to Buy and Sell Stock (Easy). Each has its own page in the questions list.

Frequently asked questions

Is Lowest Common Ancestor of a Binary Tree asked at Amazon?

Amazon appears in the public lists for Lowest Common Ancestor of a Binary Tree, reported often. Treat that as a reason to practise it, not a promise you will be asked it.

How hard is Lowest Common Ancestor of a Binary Tree?

Do I need to memorise the solution?

No. Interviewers listen for how you reason: the approach, the trade-offs, the edge cases and the complexity. Practise explaining it, not reciting it.

Sources and review date

Last reviewed 25 October 2026 Statements about other products come from their own public pages: