Pergunta de entrevista da empresa Meta
Given a full binary tree, find the longest path between any two nodes. (Essentially, find the diameter of a full binary tree.)
Resposta da entrevista
Sigiloso
22 de out. de 2017
dfs(node a)+dfs(node b)
Given a full binary tree, find the longest path between any two nodes. (Essentially, find the diameter of a full binary tree.)
Sigiloso
dfs(node a)+dfs(node b)