摘要:
原题链接在这里:https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/ 题目: We are given a binary tree (with root node root), a target node, and an 阅读全文
posted @ 2019-07-02 12:41
Dylan_Java_NYC
阅读(375)
评论(0)
推荐(0)
摘要:
原题链接在这里:https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ 题目: Return the root node of a binary search tree that matc 阅读全文
posted @ 2019-07-02 11:10
Dylan_Java_NYC
阅读(1428)
评论(0)
推荐(0)
摘要:
原题链接在这里:https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/ 题目: Given a binary tree with N nodes, each node has a different va 阅读全文
posted @ 2019-07-02 01:00
Dylan_Java_NYC
阅读(542)
评论(0)
推荐(0)
浙公网安备 33010602011771号