Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.
The Path of a Node
Question:
You will be given a series of integers. And,
you are asked to place them into a binary search tree.
Write a program that
is going to show the path to a
given node by using characters:
- "S" for start (or the root),
- "L" for left, or
- "R" for right
Input specification
In the first line you will be given two integers
(n and num). Then in the following lines you will be
given n integers where the numbers are between
-20000 and +20000 and n is between 1 and 40000.
Note: There are at most 25 numbers
in every line and the numbers are separated by space.
Output specification
If the searching number exists in the tree, show
the path to the node given by num. Otherwise,
show the message "Not in the list"
Sample Input I
6 6
4 7 3 2 6 3
|
Sample Input II
6 9
4 7 3 2 6 3
|
Sample Output I
SRL
|
Sample Output II
Not in the list
|
Для отправки решений необходимо выполнить вход.
|