2018年1月8日
[LeetCode] Closest Leaf in a Binary Tree 二叉树中最近的叶结点
摘要： Given a binary tree where every node has a unique value, and a target key k, find the value of the nearest leaf node to target k in the tree. Here, ne 阅读全文
posted @ 2018-01-08 23:46 Grandyang 阅读(6214) 评论(3) 推荐(0)
Fork me on GitHub