Questions d'entretien

Entretien pour Software Engineer In Test

-Mountain View, CA

Google

Implement a binary tree and explain it's function

Répondre

Réponses aux questions d'entretien

4 réponse(s)

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 le

0

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

Utilisateur anonyme le

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 le

1

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

Utilisateur anonyme le

Ajouter des réponses ou des commentaires

Pour commenter ceci, connectez-vous ou inscrivez-vous.