Jump to content
AJBM

levelOrder em Array

Recommended Posts

AJBM

Boas!

Eu tenho de implementar o levelOrder num array, eu já fiz isto..

public void levelOrder(int node, ArrayUnorderedList<T> tempList) throws Exception {
	QueueADT<T> nodes = new LinkedQueue<T>();

	T elementRemoved = null;
	nodes.enqueue(tree[node]);
	while (!nodes.isEmpty()) {
		elementRemoved = nodes.dequeue();
		if (elementRemoved != null) {
			tempList.addToRear(elementRemoved);
			if (tree[node * 2 + 1] != null && node * 2 + 1 < tree.length) {
				nodes.enqueue(tree[node * 2 + 1]);
			}
			if (tree[(node + 1) * 2] != null && (node + 1) * 2 < tree.length) {
				nodes.enqueue(tree[(node + 1) * 2]);
			} else {
				tempList.addToRear(null);
			}
		}
	}

}

Mas entra em ciclo infinito e ainda não descobri porque?

Share this post


Link to post
Share on other sites
AJBM

Já não entra em ciclo infinito, mas não esta a devolver os elementos todos da árvore.

public void levelOrder(int node, ArrayUnorderedList<T> tempList) throws Exception {
	QueueADT<T> nodes = new LinkedQueue<T>();
	T elementRemoved = null;
	nodes.enqueue(tree[node]);
	while (!nodes.isEmpty()) {
		elementRemoved = nodes.dequeue();
		if (elementRemoved != null) {
			tempList.addToRear(elementRemoved);
			if (tree[node * 2 + 1] != null && node * 2 + 1 < tree.length) {
				nodes.enqueue(tree[node * 2 + 1]);

			}
			if (tree[(node + 1) * 2] != null && (node + 1) * 2 < tree.length) {
				nodes.enqueue(tree[(node + 1) * 2]);

			}

		} else {
			tempList.addToRear(null);
		}
		node++;
	}
}

Share this post


Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.


×
×
  • Create New...

Important Information

By using this site you accept our Terms of Use and Privacy Policy. We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.