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

    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. The length of a path between two nodes is represented by the number of edges between them. Example 1: Input: root = [1,2,3,4,5] Output: 3.

  5. practice.geeksforgeeks.org › problems › diameter-of-binary-treeGeeksforGeeks

    We would like to show you a description here but the site won’t allow us.

  6. 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...

  7. github.com › blob › masterDiameter_of_Binary_Tree.cpp - GitHub

    The diagram below shows two trees each with diameter nine, the leaves that form the ends of a 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).

  8. 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 · Diameter of a Binary Tree. In this post a new simple O (n) method is discussed. Diameter of a tree can be calculated by only using the height function, because the diameter of a tree is nothing but maximum value of (left_height + right_height + 1) for each node.

  9. www.techiedelight.com › find-diamFind the diameter of a binary tree - Techie Delight

    Oct 21, 2021 · Given a binary tree, write an efficient algorithm to compute the diameter of it. A binary tree diameter equals the total number of nodes on the longest path between any two leaves in it. The following figure shows two binary trees with diameters 6 and 5, respectively (nodes highlighted in blue).

  10. www.hackerearth.com › problem › algorithmDiameter of a Binary Tree | Practice Problems - HackerEarth

    You need to complete the function diameterOfBinaryTree () that takes root node and total number of nodes in the tree as input and return as output a single integer i.e. the diameter of the tree