suppose a binary tree T is in memory .write a recursive procedure which finds the depth DEP of T?
Answers
Answered by
1
Answer:
Algorithm: maxDepth() 1. If tree is empty then return 0 2. Else (a) Get the max depth of left subtree recursively .
Answered by
1
Answer:
Algorithm: maxDepth() 1. If tree is empty then return 0 2. Else (a) Get the max depth of left subtree recursively .
Explanation:
Similar questions