PAT(A) 1135. Is It A Red-Black Tree (30)

1135. Is It A Red-Black Tree (30)

There is a kind of balanced binary search tree named red-black tree

PAT(A) 1134. Vertex Cover (25)

1134. Vertex Cover (25)

A vertex cover of a graph is a set of vertices such that each edge

PAT(A) 1133. Splitting A Linked List (25)

1133. Splitting A Linked List (25)

Given a singly linked list, you are supposed to rearrange its elements

PAT(A) 1132. Cut Integer (20)

1132. Cut Integer (20)

Cutting an integer means to cut a K digits long integer Z into two

PAT(A) 1127. ZigZagging on a Tree (30)

1127. ZigZagging on a Tree (30)

Suppose that all the keys in a binary tree are distinct positive integers

PAT(A) 1126. Eulerian Path (25)

1126. Eulerian Path (25)

In graph theory, an Eulerian path is a path in a graph which visits every edge

PAT(A) 1125. Chain the Ropes (25)

1125. Chain the Ropes (25)

Given some segments of rope, you are supposed to chain them into one rope.

• 1 of 6