摘要: 题目地址 There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properti... 阅读全文
posted @ 2019-12-25 22:23 vincent's_blog 阅读(40) 评论(0) 推荐(0)
摘要: 题目地址 Consider a positive integer N written in standard notation with k+1 digits a​i​​ as a​k​​ ⋯a​1​​ a​0​​ with 0≤a​i​​ 0. The... 阅读全文
posted @ 2019-12-25 22:21 vincent's_blog 阅读(24) 评论(0) 推荐(0)
摘要: 题目地址 For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qual... 阅读全文
posted @ 2019-12-25 22:20 vincent's_blog 阅读(25) 评论(0) 推荐(0)
摘要: 题目地址 Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequen... 阅读全文
posted @ 2019-12-25 22:19 vincent's_blog 阅读(20) 评论(0) 推荐(0)
摘要: 题目地址 Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. Whe... 阅读全文
posted @ 2019-12-25 22:19 vincent's_blog 阅读(32) 评论(0) 推荐(0)
摘要: 题目地址Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in ... 阅读全文
posted @ 2019-12-25 22:18 vincent's_blog 阅读(24) 评论(0) 推荐(0)
摘要: 题目地址 After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you ar... 阅读全文
posted @ 2019-12-25 22:17 vincent's_blog 阅读(27) 评论(0) 推荐(0)
摘要: 题目地址 A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. ... 阅读全文
posted @ 2019-12-25 22:16 vincent's_blog 阅读(27) 评论(0) 推荐(0)
摘要: 题目地址 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. ... 阅读全文
posted @ 2019-12-25 22:15 vincent's_blog 阅读(24) 评论(0) 推荐(0)
摘要: 题目地址 Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list. Input Specificatio... 阅读全文
posted @ 2019-12-25 22:14 vincent's_blog 阅读(33) 评论(0) 推荐(0)