Given a root of the binary tree, a node X in the tree is called good if there are no nodes with values larger than X along the route from root to X.

Given a root of the binary tree, a node X in the tree is called good if there are no nodes with values larger than X along the route from root to X.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, sre, topic-specific, devops, reliability

参考答案摘要

Write a program in which the number of good nodes in the binary tree should be returned. Example - Consider the tree given below. The Nodes marked with yellow color are good nodes. Because no such nod...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。