原题链接：https://www.patest.cn/contests/pat-a-practise/1135
1135. Is It A Red-Black Tree (30)
There is a kind of balanced binary search tree named red-black tree
原题链接：https://www.patest.cn/contests/pat-a-practise/1134
1134. Vertex Cover (25)
A vertex cover of a graph is a set of vertices such that each edge
原题链接：https://www.patest.cn/contests/pat-a-practise/1133
1133. Splitting A Linked List (25)
Given a singly linked list, you are supposed to rearrange its elements
原题链接：https://www.patest.cn/contests/pat-a-practise/1132
1132. Cut Integer (20)
Cutting an integer means to cut a K digits long integer Z into two
原题链接：https://www.patest.cn/contests/pat-a-practise/1127
1127. ZigZagging on a Tree (30)
Suppose that all the keys in a binary tree are distinct positive integers
原题链接：https://www.patest.cn/contests/pat-a-practise/1126
1126. Eulerian Path (25)
In graph theory, an Eulerian path is a path in a graph which visits every edge
原题链接：https://www.patest.cn/contests/pat-a-practise/1125
1125. Chain the Ropes (25)
Given some segments of rope, you are supposed to chain them into one rope.
原题链接：https://www.patest.cn/contests/pat-a-practise/1124
1124. Raffle for Weibo Followers (20)
John got a full mark on PAT. He was so happy that he decided to hold
原题链接：https://www.patest.cn/contests/pat-a-practise/1123
1123. Is It a Complete AVL Tree (30)
An AVL tree is a self-balancing binary search tree. In an AVL tree
原题链接：https://www.patest.cn/contests/pat-a-practise/1122
1122. Hamiltonian Cycle (25)
The "Hamilton cycle problem" is to find a simple cycle that contains every