verma82
BAN USERpublic boolean isNumberExist(TreeNode<Integer> root, int[] numArray, int index) {
TreeNode<Integer> tempRoot = findRoot(root, numArray[0]);
if (tempRoot != null && numArray.length == 1) {
return true;
} else {
return isPathExist(tempRoot, numArray, 0);
}
}
private boolean isPathExist(TreeNode<Integer> tempRoot, int[] numArray, int index) {
if (tempRoot == null) {
return index == numArray.length;
} else {
if (tempRoot.getData() == numArray[index]) {
index++;
boolean flag = isPathExist(tempRoot.getLeftChild(), numArray, index);
if (!flag && index != numArray.length)
flag = isPathExist(tempRoot.getRightChild(), numArray, index);
return flag;
}
return false;
}
}
private TreeNode<Integer> findRoot(TreeNode<Integer> root, int num) {
if (root == null) {
return null;
} else if (root.getData() == num) {
return root;
} else {
TreeNode<Integer> temp = findRoot(root.getLeftChild(), num);
if (temp == null)
temp = findRoot(root.getRightChild(), num);
return temp;
}
}
private char array[] = new char[26];
private void reverseString(String str, int index) {
if (index < 0) {
return;
} else {
char sym = str.charAt(index);
index = index - 1;
if (array[sym - 97] == '\u0000') {
System.out.print(sym);
array[sym - 97] = sym;
}
reverseString(str, index);
}
}
public ListNode mergeTwoSortedLinkList(ListNode firstList, ListNode secondList) {
ListNode finalList = null;
if (finalList == null && secondList == null) {
return finalList;
} else if (firstList == null) {
return secondList;
} else if (secondList == null) {
return firstList;
} else {
if (firstList.getData() <= secondList.getData()) {
finalList = firstList;
finalList.setNextNode(mergeTwoSortedLinkList(firstList.getNextNode(), secondList));
} else {
finalList = secondList;
finalList.setNextNode(mergeTwoSortedLinkList(firstList, secondList.getNextNode()));
}
}
return finalList;
}
- verma82 April 15, 2019