Lunatic Server Solutions Interview QuestionDeveloper Program Engineers
- 0of 0 votes
lunatic server solution is monitoring the wrong file entry in the server.
so company made another a problem for it to monitor AVL tree violation.
The problem should be solved in java...
problem states that...
This problem requires you to monitor a tree for violation of the AVL balance criteria as the tree is being
The input to the program consists of a sequence of numbers. As you read in each number, check where the
node is going to be inserted into the current tree. [At the start, the tree is empty.] If that insertion can cause
the balance of any of the nodes in the tree to go beyond what is allowed by the AVL criteria, DO NOT add
the number into the tree. Instead, print out the number into the standard output. Numbers which retain the
AVL property of the tree should be added to the tree at the appropriate place as per the method discussed in
class. Continue with the remaining numbers. Please note that you do not have to do any balancing of the
tree! The input is terminated by –1.
The output from the program consists of the numbers rejected by the program. At the end, you should also
print out the count of such numbers rejected.
Hint: It would help to keep the height of the left and right subtrees of each node along with the node. Also
note that the process of checking for violation and actually inserting are quite similar; in the former case you
do not update anything but do everything else. This observation can be used to write the code.
3 5 1 6 2 4 9 7 -1
(This means rejected key(s) are: key 7, totally 1 rejected key)
Country: United States
Interview Type: Written Test