Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary treeisthe length of the longest path between any two nodesina tree. This path mayormaynotpassthrough the root. Example: Given a binary tree1 /\2 3 /\4 5Return3, whichisthe le...
intdiameterOfBinaryTree(TreeNode *root) { if(!root)return0; intres = depthOfNode(root->left) + depthOfNode(root->right); returnmax(res, max(diameterOfBinaryTree(root->left), diameterOfBinaryTree(root->right))); } intdepthOfNode(TreeNode *node) { if(!node)return0; returnmax(depthOf...
543. 二叉树的直径 Diameter of Binary Tree 题目https://leetcode-cn.com/problems/diameter-of-binary-tree/submissions/ 路径是三选一,左子树->root->右子树、左子树->root->root.parent、右子树->root->root.parent 1、root==NULL 0 2、root-&......
} int diameterOfBinaryTree(TreeNode* root) { int height = dfs(root); return maxx; } };
The length of a path between two nodes is represented by the number of edges between them. 英文版地址 leetcode.com/problems/d 中文版描述 给定一棵二叉树,你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。 示例: 给定二叉树 1 ...
Leetcode——543. Diameter of Binary Tree 题目原址 https://leetcode.com/problems/diameter-of-binary-tree/description/ 题目描述 Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the lengt......
第一反映是递归,假设root的左子树以及右子树的diameterOfBinaryTree已经求解出来,那么我们只需要判断一种情况即可,即diameterOfBinaryTree的path并没有经过根节点的情况。 也就是说,path存在于root的左子树或者右子树中。遇到这种情况,只有可能是左子树的深度+右子树的深度 < 左子树的diameter或者右子树的diameter。所以...
AcWing-Leetcode 暑期刷题打卡训练营第5期 LeetCode_543_Diameter of Binary Tree 0 添加我们的acwing微信小助⼿ 微信号:acwinghelper 或者加入QQ群:728297306 即可与其他刷题同学一起互动哦~AcWing 算法提高班开课啦!适用人群:准备11月中旬NOIP提高组(CSP-S)的同学准备找工作笔试的同学本课程系统讲解常用算法与数...
Can you solve this real interview question? Diameter of Binary Tree - Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This p
今天介绍的是LeetCode算法题中Easy级别的第124题(顺位题号是543)。给定二叉树,您需要计算树的直径长度。 二叉树的直径是树中任意两个节点之间最长路径的长度。 此路径可能会也可能不会通过根节点。例: 给出一棵二叉树 1 / \ 2 3 / \ 4 5 返回3,这是路径[4,2,1,3]或[5,2,1,3]的长度。 注意:...