Developer/ Beer/ Disconnected
Self balancing trees are useful in one aspect. Let’s say the binary search tree is skewed then insertion, deletion and search take O(n) time.
Regular expression is very cool for string manipulation and other stuff. In python for this purpose regex module is provided.
Following are some rules to make a regex :-
In connection oriented service following sequence of instructions should be followed -