Count Good Nodes in Binary Tree - LeetCode #1448 - C++

preview_player
Показать описание
I'm Sean from Malaysia 🇲🇾
42KL Cadet 👨🏻‍💻
Learning how to code so I can make my own game 🎮
Favourite phrase currently: Yes No? 🤔

This video is made with the goal of honing my proficiency in public speaking, presentation, and coding.
Feel free to provide any feedback through the comments 😁

LeetCode Problem #1448
Difficulty: Medium

Problem Description Summary:
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.

#interview #cplusplus #leetcode
Рекомендации по теме
visit shbcf.ru