12 2021 档案

[LeetCode] 104. Construct Binary Tree from Preorder and Inorder Traversal
摘要：Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the sa 阅读全文

posted @ 2021-12-29 11:11 codingEskimo 阅读(35) 评论(0) 推荐(0)

[LeetCode] 101. Symmetric Tree
摘要：Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] 阅读全文

posted @ 2021-12-29 10:08 codingEskimo 阅读(29) 评论(0) 推荐(0)

[LeetCode] 100. Same Tree
摘要：Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they a 阅读全文

posted @ 2021-12-29 09:55 codingEskimo 阅读(35) 评论(0) 推荐(0)

[LeetCode] 23. Merge k Sorted Lists
摘要：You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list 阅读全文

posted @ 2021-12-28 07:09 codingEskimo 阅读(50) 评论(0) 推荐(0)

导航