Given a binary tree (not a BST), print the nodes at a given level n passed as an input parameter. Here is how method definition looked like:
public void printLevel(root, level)

Question

Given a binary tree (not a BST), print the nodes at a given level n passed as an input parameter. Here is how method definition looked like:
public void printLevel(root, level)

CK · Accepted Answer

We can also do a simple post-order traversal.

    void printNodesAtGivenLevel(Node node, final int requiredLevel, int currLevel){
		if(node != null){
			if(currLevel < requiredLevel){
				printNodesAtGivenLevel(node.left, requiredLevel, currLevel + 1);
				printNodesAtGivenLevel(node.right, requiredLevel, currLevel + 1);
			}
			else if(currLevel == requiredLevel){
				System.out.println(node.data);
			}
		}
	}

//call the function as printNodesAtGivenLevel(root, n, 1);

SS · Answer

BFS

PG · Answer

void printlevel(struct node *node,int level){
	if(node == NULL) return;
	if(level == 1) coutdata1){
	printlevel(node->left,level-1);   
	printlevel(node->right,level-1);
	}
	
}

Bloomberg

Pergunta de entrevista da empresa Bloomberg

Respostas da entrevista

Empresas seguidas

Buscas de vagas