How do you find the largest element in an array? (Liza + Semyon), What are the key differences between an array and a linked list? (Liza + Semyon), Name a data structure that is realized in Python with Hashmap.(Daniel and Denis), What is the difference between a binary tree and a binary search tree?.(Daniel and Denis), Describe the algorithm for inserting a new element into a Max-Heap (Elya and Irina), What is a heap in data structures, and what are the two main types of heaps? (Elya and Irina), What does the heapify operation result in? Diana and Anastasia), What is the difference between a min and a max heap? Diana and Anastasia), What are the Time Complexity and Space Complexity of a LinkedList? (Olga, Vera), What types of a LinkedList can you name? (Olga, Vera), If you had to find an optimal route from city A to city B in a small country with 10 cities, how would you organise the data about the routes? (Kirill and Zoya), What would be the best way to store data about a theoretical book shelf, where books can only be laid on top of each other, and you can only grab the top book, and store a book on the top of the pile? (Kirill and Zoya).
0%
Data structures
Udostępnij
Udostępnij
Udostępnij
autor:
Oksanapeace
Edytuj elementy
Drukuj
Osadź
Więcej
Zadania
Tabela rankingowa
Losowe karty
jest szablonem otwartym. Nie generuje wyników w tabeli rankingowej.
Wymagane logowanie
Motyw
Czcionki
Wymagany abonament
Opcje
Zmień szablon
Pokaż wszystko
Więcej formatów pojawi się podczas wykonywania ćwiczenia.
Otwórz wyniki
Kopiuj link
Kod QR
Usuń
Przywrócić automatycznie zapisane ćwiczenie:
?