Yahoo India Web Search

Sign In

Search results

  1. www.geeksforgeeks.org › problems › maximum-depth-of-binary-treeMaximum Depth Of Binary Tree | Practice | GeeksforGeeks

    Given a binary tree, find its maximum depth.A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example 1: Input: root --> 1 &nbs.

  2. www.geeksforgeeks.org › find-the-maximum-depth-or-height-of-a-treeFind the Maximum Depth or Height of given Binary Tree

    Oct 3, 2023 · maxDepth (‘2’) = max (maxDepth (‘4’), maxDepth (‘5’)) + 1 = 1 + 1 and (as height of both ‘4’ and ‘5’ are 1) maxDepth (‘3’) = 1. Follow the below steps to Implement the idea: Recursively do a Depth-first search. If the tree is empty then return 0. Otherwise, do the following.

  3. leetcode.com › problems › maximum-depth-of-binary-treeMaximum Depth of Binary Tree - LeetCode

    Maximum Depth of Binary Tree - Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

  4. www.geeksforgeeks.org › problems › height-of-binary-treeHeight of Binary Tree | Practice | GeeksforGeeks

    Your task is to complete the function height () which takes root node of the tree as input parameter and returns an integer denoting the height of the tree. If the tree is empty, return 0. Expected Time Complexity: O (N) Expected Auxiliary Space: O (N) Constraints: 1 <= Number of nodes <= 105.

  5. leetcode.com › problems › maximum-depth-of-binary-treeMaximum Depth of Binary Tree - LeetCode

    Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example 1: Input: root = [3,9,20,null,null,15,7] Output: 3 Example 2: Input: root = [1,null,2] Output: 2 Constraints:

  6. www.enjoyalgorithms.com › blog › find-height-of-a-binary-treeHeight (Maximum Depth) of a Binary Tree - EnjoyAlgorithms

    Find Height or Maximum Depth of a Binary Tree. Difficulty: Medium, Asked-In: Amazon, VMWare, Zoho, Synopsys. Key takeaway: One of the fundamental tree problems to learn problem-solving using DFS (Postorder traversal) and BFS traversal.

  7. algo.monster › liteproblems › 104104. Maximum Depth of Binary Tree - In-Depth Explanation

    Problem Description. In this LeetCode problem, we are given a binary tree, which is a tree data structure where each node has at most two children, referred to as the left child and the right child. The task is to find the maximum depth of the tree.

  8. www.naukri.com › code360 › problemsMaximum Depth Of A Binary Tree - Naukri Code 360

    Your task is to find the maximum depth of the given Binary tree. Depth of a binary tree is the same as its height. In simpler terms, you have to find the total number of nodes encountered while moving from the root node to the farthest leaf node, along the longest path of the binary tree.

  9. www.geeksforgeeks.org › problems › minimum-depth-of-a-binary-treeMinimum Depth of a Binary Tree | Practice | GeeksforGeeks

    Minimum depth is between nodes 10,20 and 40. Your Task: You don't need to read input or print anything. Complete the function minDepth () which takes the root node as an input parameter and returns the minimum depth. Expected Time Complexity: O (N) Expected Auxiliary Space: O (height of the tree) Constraints: 1 ≤ N ≤ 10^5. Topic Tags.

  10. algotree.org › algorithms › recursiveFinding the maximum depth of a binary tree :: AlgoTree

    The maximum depth of a binary tree could easily be found using a simple recursive algorithm. The maximum depth would be 1 + maximum of ( depth of root’s left subtree or depth of root’s right subtree ).