Write code for a binary tree who find the lowest node and bubbles it up to the root.

Question

Anónimo · Accepted Answer

what do you mean by bubble up!?

Anónimo · Answer

private static Node root;
private static Node temp;
private static int least = Integer.MAX_VALUE;

private static Node swapLeast(Node r) {
		if (r.val < least) {
			least = r.val;
			temp = r;
		}
		if (r.left != null)
			swapLeast(r.left);
		if (r.right != null)
			swapLeast(r.right);
		temp.val = root.val;
		root.val = least;
		return root;
	}

Tripadvisor

Pregunta de entrevista de Tripadvisor

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo