Demo - Estrutura de Dados e Algoritmos (2021)

With the Moodle app, you can learn wherever you are, whenever you want, with these app features:

• Easily access course content - browse the content of your courses, even when offline
• Connect with course participants - quickly find and contact other people in your courses
• Keep up to date - receive instant notifications of messages and other events, such as assignment submissions
• Submit assignments - Upload images, audio, videos and other files from your mobile device
• Track your progress - View your grades, check completion progress in courses and browse your learning plans
• Complete activities anywhere, anytime - attempt quizzes, post in forums, play SCORM packages, edit wiki pages and more - both on and off-line

... and more!

Nesta página você encontra vídeo-aulas relacionadas à recursividade.

Nesta página você encontra vídeo-aulas sobres Listas Lineares - Vetores.

Nesta página você encontra vídeo-aulas sobres Listas Lineares - Vetores.

Visualização de estruturas de dados e algoritmos através de animação

Nesta página você encontra vídeo-aulas sobres Listas Simplesmente Encadeadas

Nesta página você encontra vídeo-aulas sobres Listas Simplesmente Encadeadas, com um novo atributo para o final da lista (último elemento) e métodos para inserir e excluir elementos no início e no final da lista.

Visualização de estruturas de dados e algoritmos através de animação

Nesta página você encontra vídeo-aulas sobre as Árvores

A Binary Search Tree (BST) is a binary tree in which each vertex has only up to 2 children that satisfies BST property: All vertices in the left subtree of a vertex must hold a value smaller than its own and all vertices in the right subtree of a vertex must hold a value larger than its own (we have assumption that all values are distinct integers in this visualization and small tweak is needed to cater for duplicates/non integer). 

A Binary Search Tree (BST) is a binary tree in which each vertex has only up to 2 children that satisfies BST property: All vertices in the left subtree of a vertex must hold a value smaller than its own and all vertices in the right subtree of a vertex must hold a value larger than its own (we have assumption that all values are distinct integers in this visualization and small tweak is needed to cater for duplicates/non integer). 

Nesta página você encontra vídeo-aulas sobre as Árvores AVL

An Adelson-Velskii Landis (AVL) tree is a self-balancing BST that maintains it's height to be O(log N) when having N vertices in the AVL tree.