What is the difference between tree depth and height?

Posted by Gabriel Šcerbák on Stack Overflow See other posts from Stack Overflow or by Gabriel Šcerbák
Published on 2010-04-08T21:47:59Z Indexed on 2010/04/08 21:53 UTC
Read the original article Hit count: 266

Filed under:
|
|

This is a simple question from algorithms theory. The difference between them is that in one case you count number of nodes and in other number of edges on the shortest path between root and concrete node. Which is which?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about tree