Pergunta de entrevista da empresa Grab

android, binary trees

Respostas da entrevista

Sigiloso

26 de jan. de 2019

tree in which all the node have at most 2 child nodes are known as Binary tree. i.e a tree can have 0 child node, 1 child and 2 child nodes but not more than two child nodes.

3

Sigiloso

26 de jan. de 2019

tree in which all the node have at most 2 child nodes are known as Binary tree. i.e a tree can have 0 child node, 1 child and 2 child nodes but not more than two child nodes.

Pergunta de entrevista da empresa Grab: android, binary trees | Glassdoor