在二叉树而不是BST中查找节点的深度

Question

I have a binary tree not bst ,I need to find the depth of a node in that binary tree Is there any other way to achieve other than level order traversal using some dilimeter to main the count of level .

As input I have the root node of the tree and one of the node of the tree for which i need find the depth.

I want to have some recursive way to find this

Answer 1

如果您不想执行BFS，则可以执行DFS（也可以递归执行）。

Answer 2

pseudo-code for DFS function, the first call will be DFS(root) .

DFS(node v, integer d)
  visited[v] = true
  depth[v] = d

  for each u such that u is adjacent to v
    if visited[u] == false
      DFS(u, d+1)

Answer 3

尝试在递归函数中传递一个附加参数以指示深度。