Google Interview Question
Web:
www.google.com
|
HQ:
Mountain View, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
1,223 Interview Reviews |
Back to all Google Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Software Engineer at Google:
Aug 27, 2011
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (3)
1 of 2 people found this helpful
Nov 21, 2011
a tree is a graph with N-1 edges (N = number of vertices). then i think you just need to pick 1 vertex and check if you can reach all the others from this one
Helpful Answer?
Yes |
No
Inappropriate?
Dec 29, 2011
it depends on your definition of a tree. Technically all you need to qualify as a tree is to have that tree's nodes be connected and have no cycles. That means you don't necessarily need all the nodes of the graph to be part of the tree (that's called a spanning tree)
Helpful Answer?
Yes |
No
Inappropriate?
To comment on this
question,
Sign In with Facebook or
Sign Up
You might also be interested in: Interview Questions, Software Engineer Interview Questions, Google Interview
2 of 2 people found this helpful
by M H: