Brijesh Thakur
BAN USERpublic void void printTreeLevelFromBottom(Node root) {
Queue<Node> queue = new LinkedList<>();
List<Integer> printTreeList = new ArrayList<>();
printTreeList.add(root.data);
queue.add(root);
while (!queue.isEmpty()) {
Node node = queue.poll();
Node leftNode = node.left;
Node rightNode = node.right;
if (rightNode != null) {
printTreeList.add(rightNode.data);
queue.add(rightNode);
}
if (leftNode != null) {
printTreeList.add(leftNode.data);
queue.add(leftNode);
}
}
for (int index = printTreeList.size() - 1; index >= 0; index--) {
System.out.print(printTreeList.get(index) + " ");
}
}
package com.test;
public class CharacterCount {
/**
* @param args
*/
public static void main(String[] args) {
String str="abcbdserersgassereasssraa";
countMaxCharacter(str);
}
public static void countMaxCharacter(String str)
{
int[] asciiArr=new int[255];
char[] charArr=str.toCharArray();
int maxCount=1;
char occursMost=' ';
int charAscii;
for(int index=0;index<charArr.length;index++)
{
charAscii=(int)charArr[index];
int charCount=asciiArr[charAscii];
asciiArr[charAscii]=++charCount;
if(charCount>maxCount)
{
maxCount=charCount;
occursMost=charArr[index];
}
}
System.out.println("Character Occurs Most "+occursMost+" Count "+maxCount);
}
}
- Brijesh Thakur November 13, 2016