2021年2月10日
PAT A1155 Heap Paths (30 分)
摘要： In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the 阅读全文
posted @ 2021-02-10 21:14 coderJ_ONE 阅读(81) 评论(0) 推荐(0)
PAT A1151 LCA in a Binary Tree (30 分)
摘要： The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. Given any two nodes in a bin 阅读全文
posted @ 2021-02-10 21:10 coderJ_ONE 阅读(66) 评论(0) 推荐(0)
PAT A1147 Heaps (30 分)
摘要： In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the 阅读全文
posted @ 2021-02-10 21:07 coderJ_ONE 阅读(47) 评论(0) 推荐(0)
PAT A1098 Insertion or Heap Sort (25 分)
摘要： According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insert 阅读全文
posted @ 2021-02-10 21:04 coderJ_ONE 阅读(76) 评论(0) 推荐(0)
PAT A1089 Insert or Merge (25 分)
摘要： According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insert 阅读全文
posted @ 2021-02-10 21:00 coderJ_ONE 阅读(60) 评论(0) 推荐(0)