LeetCode Question · Oct 2021 · USA

Google | OA | Binary-Tree String Search

SWE OA
Sign in to bookmark Original →
5 upvotes 776 views 1 reply

Question Details

The Google interview question was 3 parts: The Problem: Given a binary tree, where each node has: left, right, length and string. Example: Problems: 1. Print the string in pre-order. 2. Write a fucntion that...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Strings

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview
← All Google questions Google Software Engineer Questions → All Trees Questions →