Better Tree Height Function

[Clunk_Head]

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

    def height(self):
        left_height = 0
        right_height = 0
        if self.left:
            left_height = self.left.height()
        if self.right:
            right_height = self.right.height()
        return max(left_height, right_height) + 1

How can I clean up my height function? I think it's a bit verbose. I feel like there should be a simpler way to do this?

[stullis]

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None
 
    def height(self):
        try:
            return max([n.height() for n in self.__dict__.values() if isinstance(n, Node)]) + 1
        except ValueError:
            return 1

[Clunk_Head]

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None
 
    def height(self):
        try:
            return max([n.height() for n in self.__dict__.values() if isinstance(n, Node)]) + 1
        except ValueError:
            return 1

Nice and shiny, thank you.