Diameter of node = height of Left sub tree of node + height of Right sub tree of node + 1 (node itself).
Default load factor of Hashmap is 0.75f (i.e 75% of current map size).You can also say, load factor is a measure "Till what load, hashmap can allow elements to put in it before its capacity is automatically increased"
Default capacity of Hashmap is 2^4 = 16 buckets.Let say we have well implemented hashcode() method, which make sure that key-value pair will be well distributed across 16 buckets equally.
 |
| Hashmap capacity and load factor relation |
Hashmap arranges the objects in such a way, that searching any object in hashmap will be done in almost O(1) complexity.How arranging items in particular way can make searching faster. Lets see with example,
"select * from user where username = ' " + username + " ' ";Above query is not complete as it has dependency on username variable.
Time complexity to solve this problem should not be greater then O(n)Bit Manipulation will be helpful in this situation.
Space complexity to solve this problem should not be greater then O(1)
Time complexity to solve this problem should not be greater then O(n)Bit Manipulation will be helpful in this situation.
Space complexity to solve this problem should not be greater then O(1)
int inorder[] = {20, 30, 35, 40, 45, 50, 55, 60, 70};
int preorder[] = {50, 40, 30, 20, 35, 45, 60, 55, 70};
By using above 2 given In order and Pre Order traversal, construct Binary Tree like shown below,
int[] inOrder = { 4, 2, 6, 5, 7, 1, 3 };
int[] levelOrder = { 1, 2, 3, 4, 5, 6, 7 };
package javabypatel.tree;
class Node{
private int data;
private Node left;
private Node right;
private Node nextRight; <---- New pointer introduced to connect to adjacent Node.
}
 |
| Check if two trees are mirror images of each other |
 |
| Check if two binary trees are identical or not |
 |
| Insert node in binary search tree in Java |
 |
| Max sum contiguous subarray solution |
 |
| Delete a node in binary search tree cases |
 |
| Binary Tree Example |
 |
| Sample Binary Search Tree |
 |
| Add a node in binary tree |
 |
| Stack trace of printing all possible strings of length K that can be formed from a set of N characters |
package javabypatel;
public class GenerateAllPermutationOfNBits {
public static void main(String[] args) {
permutation("ABC", "", 2);
permutationOfBinaryNumbers("", 2);
}
private static void permutation(String str, String prefix, int lengthOfPermutationString){
if(prefix.length()==lengthOfPermutationString){
System.out.println(prefix);
}else{
for (int i = 0; i < str.length(); i++) {
permutation(str, prefix + str.charAt(i), lengthOfPermutationString);
}
}
}
private static void permutationOfBinaryNumbers(String prefix, int lengthOfPermutationString){
if(prefix.length()==lengthOfPermutationString){
System.out.println(prefix);
}else{
permutationOfBinaryNumbers(prefix + "1", lengthOfPermutationString);
permutationOfBinaryNumbers(prefix + "0", lengthOfPermutationString);
}
}
}
package javabypatel;
import java.util.Arrays;
public class GenerateAllPermutationOfNBits {
public void printCombination(int[] arr, int i, int lengthOfCombination, int combinationSet) {
if (i == lengthOfCombination) {
System.out.println(Arrays.toString(arr));
return;
}
for (int j=0; j<combinationSet; j++) {
arr[i] = j;
printCombination(arr, i+1, lengthOfCombination, combinationSet);
}
}
public void printCombinationOfGivenSet(char[] arr, int i, int lengthOfCombination, char[] combinationSet) {
if (i == lengthOfCombination) {
System.out.println(Arrays.toString(arr));
return;
}
for (int j=0; j<combinationSet.length; j++) {
arr[i] = combinationSet[j];
printCombinationOfGivenSet(arr, i+1, lengthOfCombination, combinationSet);
}
}
public static void main(String[] args) {
GenerateAllPermutationOfNBits obj = new GenerateAllPermutationOfNBits();
int lengthOfCombination = 2; //(length of the combination to generate)
int combinationSet = 2;
//(2 means use 0 and 1 while generating combination)
//(3 means use 0, 1 and 2 while generating combination)
obj.printCombination(new int[lengthOfCombination], 0, lengthOfCombination, combinationSet);
System.out.println("Print from Given set...");
char[] combinationSetArr = new char[]{'A', 'B', 'C'};
obj.printCombinationOfGivenSet(new char[lengthOfCombination], 0, lengthOfCombination, combinationSetArr);
}
}
