Loading

2020年11月15日
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal（根据二叉树的前序和中序遍历构建二叉树）
摘要： Difficulty: Medium Related Topics: Array, Tree, Depth-first Search Link: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder 阅读全文
posted @ 2020-11-15 14:52 Zhongju.copy() 阅读(64) 评论(0) 推荐(0)
[LeetCode] 114. Flattern Binary Tree to Linked List（将二叉树扁平化成单链表）
摘要： Difficulty: Medium Related Topics: Tree, Depth-first Search Link: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ Description Given 阅读全文
posted @ 2020-11-15 14:35 Zhongju.copy() 阅读(98) 评论(0) 推荐(0)