python二叉树深度计算,python中二叉树的最大深度

I created a tuple from a binary tree and it looks like this:

tuple = (1,(2,(4,5,6),(7,None,8)),(3,9,(10,11,12)))

The tree structure becomes more clear by applying indentation:

(1,

(2,

(4,

5,

6

),

(7,

None,

8

)

),

(3,

9,

(10,

11,

12

)

)

)

I know how to find the maximum depth of the binary tree using recursive method, but I am trying to find the maximum depth using the tuple I created. Can anyone help me with how to do it?

解决方案

Recursive method:

a = (1,(2,(4,5,6),(7,None,8)),(3,9,(10,11,12)));

def depth(x):

if(isinstance(x, int) or x == None):

return 1;

else:

dL = depth(x[1]);

dR = depth(x[2]);

return max(dL, dR) + 1;

print(depth(a));

The idea is to determine the depth of a tree by looking at its left and right subtree. If the node does not have subtrees, a depth of 1 is returned. Else it returns max(depth of right, depth of left) + 1