Check if a given array can represent Preorder Traversal of Binary Search Tree. OR Check if given Preorder traversal is valid BST (Binary Search Tree). ORGiven an array of numbers, verify whether it is the correct Preorder traversal sequence of a binary...
Home
»
Archives for January 2016
Verify Preorder Sequence Of Binary Search Tree(BST)
in
Binary Search Tree,
Interviews
- on 11:46:00
- No comments
Bubble Sort
in
Interviews,
Sorting
- on 02:50:00
- No comments

Bubble Sort (Sinking sort)
Given a array of integers, Sort it. Lets understand what is the input and the expected output.
...
Insertion Sort
in
Interviews,
Sorting
- on 21:39:00
- No comments

Insertion Sort
Given a array of integers, Sort it using Insertion sort.
Lets understand what is the input and the expected output.
...
Selection Sort
in
Interviews,
Sorting
- on 02:48:00
- No comments

Selection Sort
Given a array of integers, Sort it. Lets understand what is the input and the expected output.
...
Infinite loop in HashMap
in
Interviews,
Java
- on 09:17:00
- No comments

Why HashMap should not be used in multi threaded environment? Can it cause infinite loop as well?When get method go to infinite loop in HashMap?
If HashMap is used in Multi threading environment, there are chances that Get and Put operation can lead...