Leetcode 104. Maximum Depth of Binary Tree

Given a tree, determine its depth; that is the number of nodes in the path from the root to the farthest leaf. Please fill in the following function to find the max depth of a tree using the following Node API. (GIVEN) Abstract class that holds a tree node """ # class Node { # def getValue() -> int; # def getLeft() -> Node: // May return null if no left/right child exists # def getRight() -> Node; // May return null if no left/right child exists # }

Calculate the depth of a binary tree