How to understand the maximum depth of python binary tree
In this issue, Xiaobian will bring you about the maximum depth of python binary tree. The article is rich in content and analyzed and described from a professional perspective. After reading this article, I hope you can gain something.
Maximum depth of binary tree 1 topic
Given a binary tree, find its maximum depth.
The depth of a binary tree is the number of nodes on the longest path from the root node to the farthest leaf node.
Note: A leaf node is a node that has no children.
Examples:
Given binary tree [3,9,20,null,null,15,7],
3 / \ 9 20 / \ 15 7
Returns its maximum depth of 3.
2 analysis
The intuitive way is to solve the problem recursively. Here we demonstrate an example of DFS (Depth First Search) policy. Convenient and quick, directly use the following figure to explain!
3 Complete code
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDept = 0;
int dept = 1;
int maxDepth(TreeNode* root) {
if(root == NULL){
return 0;
}else{
int leftHeight = maxDepth(root->left);
int rightHeight = maxDepth(root->right);
return leftHeight>rightHeight ? leftHeight + 1 : rightHeight + 1;
}
}
};
The above is how to understand the maximum depth of python binary tree shared by Xiaobian. If there is a similar doubt, please refer to the above analysis for understanding. If you want to know more about it, please pay attention to the industry information channel.
