Write a program that returns the leftmost value in the final row of a binary tree given the root.

Write a program that returns the leftmost value in the final row of a binary tree given the root.

题目类型: 技术面试题

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

难度: medium

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

参考答案摘要

Example - In the below image, we can see that the leftmost node in the last row of the tree is 7. So we need to return that. We can solve this problem recursively by traversing to the last row and ret...

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