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 · Find the Maximum Depth or Height of given Binary Tree - GeeksforGeeks. Last Updated : 03 Oct, 2023. Given a binary tree, the task is to find the height of the tree. The height of the tree is the number of vertices in the tree from the root to the deepest node. Note: The height of an empty tree is 0 and the height of a tree with single node is 1.

  3. www.geeksforgeeks.org › height-and-depth-of-a-node-in-a-binary-treeHeight and Depth of a node in a Binary Tree - GeeksforGeeks

    May 27, 2024 · Given a Binary Tree consisting of N nodes and a integer K, the task is to find the depth and height of the node with value K in the Binary Tree. The depth of a node is the number of edges present in path from the root node of a tree to that node.

  4. practice.geeksforgeeks.org › problems › maximum-depth-of-binary-treeGeeksforGeeks

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

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

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

  8. practice.geeksforgeeks.org › problems › maximum-depth-of-binary-treePractice | GeeksforGeeks | A computer science portal for geeks

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

  9. leetcode.ca › 2016/03/13-104-Maximum-Depth-of-Binary-Tree104 - Maximum Depth of Binary Tree | Leetcode

    Mar 13, 2016 · Description. 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:

  10. beesec.gitbook.io › algorithms › graphsMaximum Depth of Binary Tree | Algorithms - GitBook

    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. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7],