韦德国际1946英国 > 计算机网络 > 计算机网络:二叉树的最小

原标题:计算机网络:二叉树的最小

浏览次数:104 时间:2019-11-16

[LeetCode] Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree,depthbinary

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

计算机网络:二叉树的最小。递归

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int maxDepth(TreeNode* root) {
13         if(root == NULL){
14             return 0;
15         }
16         
17         int leftDepth = maxDepth(root->left);
18         int rightDepth = maxDepth(root->right);
19         
20         return max(leftDepth, rightDepth) 1;
21     }
22 };

 

. Maximum Depth of Binary Tree,depthbinary Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down...

**111. Minimum Depth of Binary Tree **
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
代码如下:

 

Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

解题思路:

那道题正是求二叉树的可观而已。递推求解两行代码就可以。‘

 

/**
 * 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 maxDepth(TreeNode* root) {
        if(root==NULL){
            return 0;
        }
        return max(maxDepth(root->left), maxDepth(root->right))   1;
    }
};

 

] Maximum Depth of Binary Tree Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path fr...

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root==NULL)
            return 0;
        int left = minDepth(root->left);
        int right = minDepth(root->right);
        if(root->left==NULL&&root->right==NULL)
            return 1;
        if(root->left==NULL)
            left = INT_MAX;
        if(root->right==NULL)
            right = INT_MAX;
        return left<right ? left   1 : right   1;
    }
};

本文由韦德国际1946英国发布于计算机网络,转载请注明出处:计算机网络:二叉树的最小

关键词:

上一篇:画图问题,计算几何

下一篇:没有了