/*inorder*/
void printInorder(Node node) {
if (node == null)
return;
printInorder(node.left);
System.out.print(node.key + " ");
printInorder(node.right);
}
/*two methods for level order traversal*/
void printLevelOrder() {
int h = height(root);
int i;
for (i=1; i<=h; i++)
printCurrentLevel(root, i);
}
void printCurrentLevel (Node root ,int level) {
if (root == null)
return;
if (level == 1)
System.out.print(root.data + " ");
else if (level > 1) {
printCurrentLevel(root.left, level-1);
printCurrentLevel(root.right, level-1);
}
}