novice.not
BAN USERjust one correction in your code:
Supposing start to be the variable containing start node value of the linkedlist
public void reverseLink(Node<T> root)
{
if(root.getNextLink()==null){
this.start=root;
return;
}else{
}
reverseLink(root.getNextLink());
(root.getNextLink()).setNextLink(root);
root.setNextLink(null);
}
Finding firstLargest and second largest element
public static void rangeHL(int [] arr){
int firstLargestIndex=0;
int secondlargestIndex=0;
for(int i=0;i<arr.length;i++){
if(arr[i]>arr[firstLargestIndex]){
secondlargestIndex=firstLargestIndex;
firstLargestIndex=i;
}else if(arr[i]>arr[secondlargestIndex]){
secondlargestIndex=i;
}
}
}
Assuming that we have nodes containing info1 and info2 present inside the BST
public BTreeNode<T> leastCommonParent(BTreeNode<T> node,T info1,T info2){
BTreeNode<T> node1 = new BTreeNode<T>(info1);
BTreeNode<T> node2 = new BTreeNode<T>(info2);
//return null if node==null
if(node==null){
return null;
}
if(node.getLeft()!=null){
if(node.getLeft().compareTo(node1)==0 || node.getLeft().compareTo(node2)==0){
return node;
}
}
if(node.getRight() !=null){
if(node.getRight().compareTo(node1)==0 || node.getRight().compareTo(node2)==0){
return node;
}
}
if(node.compareTo(node1)>0 && node.compareTo(node2)>0){
return leastCommonParent(node.getLeft(), info1, info2);
//return node;
}
else if(node.compareTo(node1)<0 && node.compareTo(node2)<0){
return leastCommonParent(node.getRight(), info1, info2);
}else{
return node;
}
}
- novice.not April 16, 2015