Interview Question

Software Engineer In Test Interview

-Mountain View, CA

Google

Implement a binary tree and explain it's function

Answer

Interview Answers

3 Answers

7

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

1

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

Anonymous on

3

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

Add Answers or Comments

To comment on this, Sign In or Sign Up.