richecr / leda-20182

Repositório dos roteiros da disciplina de Laboratório de Estrutura de Dados

💫 About Me:

🔭 I'm currently working as a Software Engineer II at @olxbr
📚 I am a graduate of the Computer Science course at UFCG.
📚 I'm doing an MBA in Full Cycle Architecture.
🌱 I like to study everything that involves programming, mainly web development, functional programming, software engineering and machine learning.

My Page

• https://richecr.github.io/richecr-portofolio/

🌐 Socials:

💻 Tech Stack:

📊 GitHub Stats:

🏆 GitHub Trophies

✍️ Random Dev Quote

🔝 Top Contributed Repo

😂 Random Dev Meme

---

leda-20182's Issues

método search da árvore B com index errado

        int index = 1;

	while (index <= node.size() && element.compareTo(node.getElementAt(index)) > 0) {
		index += 1;
	}
	if (index <= node.size() && element == node.getElementAt(index)) {
		return new BNodePosition<T>(node, index);
	}
	if (node.isLeaf()) {
		return new BNodePosition<T>();
	}
	return search(node.getChildren().get(index), element);

O correto n seria começar com index = 0 ?

link