btree节点深度(java)

Question

我卡住了btree节点的深度
有没有人有算法或代码来找到btree节点的深度??
由于

Answer 1

Psuedocode:

Function Depth
    If the right child isn't null, set left_depth to Depth(left_child), else set left_depth to 0.
    If the left child isn't null,set right_depth to Depth(right_child), else set right_depth to 0.
    return maximum(left_depth, right_depth) + 1;