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.

Helpful Answer?

Yes | No

Inappropriate?

1 of 1 people found this helpful

Jan 11, 2011

by Anonymous:

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.

Helpful Answer?

Yes | No

Inappropriate?

To comment on this question, Sign In with Facebook or Sign Up

You might also be interested in: Interview Questions, Software Engineer In Test Interview Questions, Google Interview

Employees' Choice Winner: 2009, 2010, 2011, 2012

Google Overview (GOOG)

Edit

Website www.google.com

HQ Mountain View, CA

Industry

Internet Search & Navigation Services

Size

32,400+ Employees, $23B+ Revenue

Competitors

Microsoft, Apple, Facebook

Interviews by Company

Salaries by Company

Tags are like keywords that help categorize interview questions that have something in common.

About Us | Feedback | Help

Glassdoor ® is a registered trademark of Glassdoor, Inc.

Overview

Salaries

Reviews

Interviews

Photos

Jobs

Connections

1,223 Interview Reviews |

Interview Question for Software Engineer In Test at Google:

Implement a binary tree and explain it's function

Answers & Comments (2)

Flag this {0} as inappropriate

Thank you!

Oops!