Yahoo India Web Search

Sign In

Search results

  1. www.geeksforgeeks.org › problems › diameter-of-binary-treeDiameter of a Binary Tree | Practice | GeeksforGeeks

    Diameter of a Binary Tree. Difficulty: Medium Accuracy: 47.37% Submissions: 287K+ Points: 4. The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two end nodes.

  2. www.geeksforgeeks.org › diameter-of-a-binary-treeDiameter of a Binary Tree - GeeksforGeeks

    6 days ago · The diameter/width of a tree is defined as the number of nodes on the longest path between two end nodes. The diagram below shows two trees each with a diameter of nine, the leaves that form the ends of the longest path are shaded (note that there is more than one path in each tree of length nine, but no path longer than nine nodes).

  3. www.geeksforgeeks.org › problems › size-of-binary-treeSize of Binary Tree | Practice | GeeksforGeeks

    Given a binary tree of size n, you have to count the number of nodes in it. For example, the count of nodes in the tree below is 4. 1 / \ 10 &nb

  4. leetcode.com › problems › diameter-of-binary-treeDiameter of Binary Tree - LeetCode

    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 path may or may not pass through the root.

  5. www.youtube.com › watchDiameter of a Binary Tree | GeeksforGeeks - YouTube

    Sep 13, 2017 · Find Complete Code at GeeksforGeeks Article: http://www.geeksforgeeks.org/diameter-of-a-binary-tree/Practice Problem Online Judge: http://practice.geeksforge...

  6. practice.geeksforgeeks.org › problems › diameter-of-binary-treeDiameter of a Binary Tree | Practice | GeeksforGeeks

    The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two end nodes. The diagram below shows two trees each with diameter nine, the leaves that form the ends of the longest path are shaded (note that t

  7. algotree.org › algorithms › tree_graph_traversalFinding the diameter of a binary tree :: AlgoTree

    To find the diameter of a binary tree, we do the below. Find the height of the left subtree and right subtree of every node recursively. If we add the two heights ( height of left subtree + height of right subtree ) of a node, we get the diameter passing through that node.

  8. leetcode.com › problems › diameter-of-binary-treeDiameter of Binary Tree - LeetCode

    Can you solve this real interview question? Diameter of Binary Tree - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

  9. studyalgorithms.com › tree › diameter-of-a-binary-treeDiameter of a Binary Tree – Study Algorithms – Trees

    Jun 30, 2020 · The diameter of the binary tree is defined as the length of the longest path between any two nodes in the tree. Diameter of a binary tree 7 through root. In the above example the diameter of the binary tree is 7.

  10. www.geeksforgeeks.org › diameter-of-a-binary-tree-in-on-a-new-methodDiameter of a Binary Tree in O(n) [A new method] - GeeksforGeeks

    May 22, 2024 · Given a Binary Indexed Tree with N nodes except root node 0 (Numbered from 1 to N), Find its diameter. Binary Indexed Tree is a tree where parent of a node number X = X - (X & (X - 1)) i.e. last bit is unset in X. The diameter of a tree is the longest simple path between any two leaves. Examples: Input: N = 12 Output: 6 Explanation: Path from n

  1. Searches related to diameter of binary tree gfg

    diameter of binary tree leetcode