Google | Phone Screen | Longest Path in a Tree
Anonymous User
4349

Given the following classes:

class Node {
	int id;
	Link[] links;
}

class Link {
	int bytesPerSec;
	Node dest;
}

Imagine you have a graph of nodes and links find the time it takes to get information from a root node to all the other nodes.

int time(Node root) {
	// todo
}
Comments (13)