Height of Special Binary Tree

1
2
3
4
5
6

class Solution:
    def heightOfTree(self, n: Optional[TreeNode]) -> int:
        if n is None or (n.left is not None and n.left.right == n):
            return 0
        else:
            return 1 + max(self.heightOfTree(n.left), self.heightOfTree(n.right))