search

Google-Developer-Student-Club-CCOEW / Competitive-Programming-2023-GDSC-CUMMINS-X-GDSC-MMCOE

Welcome to the Hacktoberfest 2023 Competitive-Programming Cohort for Cummins College and MMCOE students! To request issue assignment, create a pull request, providing: 1. Full Name 🧑‍🎓 2.Email 📧 3.College ID (RNO) 🔢 4.Branch of Study.📚 5. Year 📆 .The Cummins College and MMCOE students' PRs will be considered only. Thank you!
9 stars 69 forks source link

Count Good Nodes in Binary Tree #75

Closed Sonia312 closed 11 months ago

Sonia312 commented 1 year ago

Write code in the preferred language and attach output with it.

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.

Return the number of good nodes in the binary tree.

Example 1:

image

Input: root = [3,1,4,3,null,1,5] Output: 4 Explanation: Nodes in blue are good. Root Node (3) is always a good node. Node 4 -> (3,4) is the maximum value in the path starting from the root. Node 5 -> (3,4,5) is the maximum value in the path Node 3 -> (3,1,3) is the maximum value in the path.

Example 2:

image

Input: root = [3,3,null,4,2] Output: 3 Explanation: Node 2 -> (3, 3, 2) is not good, because "3" is higher than it.

Example 3:

Input: root = [1] Output: 1 Explanation: Root is considered as good.

aniketsinha620 commented 1 year ago

Hey @Sonia312 , please assign me this problem

anu-shka-k commented 11 months ago

Hi @Sonia312 , Could you assign this issue to me?

anu-shka-k commented 11 months ago

I will not be able to contribute to this issue. Sorry for the inconvinience.

bhairavibhuyar commented 11 months ago

Hello, I would like to work on this issue. Can you please assign it to me? Name - Bhairavi Bhuyar Year - Third Year College - CCOEW, Pune