KEY NOT FOUND: coverImgAlt
Logo
See All Photos
Best Places to Work 2022

Google

Engaged Employer

Google

Add an Interview

Interview Question

Software Engineer In Test Interview

-

Google

Implement a binary tree and explain it's function

AnswerAdd Tags

Interview Answers

4 Answers

8

Hi Xin Li, A binary tree is not the same as binary search tree.. A binary tree is a tree in which every node has atmost two children nodes. It is a k-ary tree in which k=2. A complete binary tree is a tree in which all nodes have the same depth.

Anonymous on

0

For the love of god I wish I got a problem this easy

Anonymous on

4

Binary Search tree is a storage data structure that allows log(n) insertion time, log(n) search, given a balanced binary search tree. The following implementation assumes an integer bst. There's a million implementations. Just look on wikipedia for search and insert algorithms.

Xin Li on

1

The fact is ttttttt t t. T to t. To. A a aaAs Sdsassss.

Anonymous on

Add Answers or Comments

To comment on this, Sign In or Sign Up.

Google Careers

Cover image for Google

We strive to provide Googlers and their loved ones with a world-class benefits experience, focused on supporting their physical, financial,...More

  • Where we work
  • Building belonging
  • Googler stories
  • Build your future
This is the employer's chance to tell you why you should work for them. The information provided is from their perspective.