Data Structures flashcards
177 flashcard decks by 107 users · Page 3 of 5
Explore Data Structures flashcards on GoConqr, covering arrays, linked lists, graphs and sorting. University students and professional candidates can practise definitions and analysis, while school students can revise key structures and teachers can find questions. The page brings together over 160 flashcards by more than 100 users. Choose a deck and start revising.
Select topic
Flashcards
-
1 cardsBinary Search Tree Iterator mplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node ...
-
14 cardsComputing A-Level Chapter 8
-
10 cardsA2 Data Structures - Binary Trees and Linked Lists Binary Tree Data Structure
-
10 cardsGraph and Tree Traversal What is an algorithm in computing?
-
10 cardsCS2004 Flash cards What is LIFO ? Give an example.
-
10 cardsTree Structure
-
8 cardsHash Tables and Dictionaries
-
10 cardsDSA - Lecture 4a What is a dictionary ADT like?
-
9 cardsdata structures Binary search tree, 3 main elements of a node
-
1 cardsAdd Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in r...
-
10 cardsKey definitions for paper 2 what are arrays
-
13 cardsComputing A-Level Chapter 7
-
12 cardsComputing A-Level Chapter 10
-
1 cardsBinary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level ...
-
10 cardsData Structures
-
8 cardsData Structures - Stack and Queue structure What is a data structure?
-
6 cardsUntitled What is the worst-case running time for finding an element in a binary tree (not necessarily a binary searc...
-
1 cardsMirror BST
-
1 cardsFind the Missing Number You are given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates...
-
6 cardsTrees What is a Tree?
-
8 cardsWeek 9: Backtracking & Stacks/Queues
-
1 cardsImplement Stack using Queues push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the to...
-
10 cardsStacks & Queues What's an ADT
-
1 cardsDelete Node in a BST Delete Node in a BST
-
4 cardsTrees LC [LC102] Binary Tree Level Order Traversal
-
5 cardsChapter 9 Tuples
-
1 cardsRemove Duplicates from a Linked List Remove duplicate nodes from linked list of integers while keeping only the first occurrence of duplicates.
-
10 cardsBinary Trees define the order of a rooted tree
-
7 cardsBinary Search Trees define binary search tree
-
5 cardsF453 Data Structures - Binary Trees Is a binary tree a static or dynamic data structure?
-
3 cardsStacks, Queues What are stacks/queues
-
1 cardsMove Zeroes Shift all zeroes to the end
-
1 cardsSwap Nodes in Pairs Swap Nodes in Pairs
-
3 cardsCreate a minimal BST from array
-
1 cardsLists and Linked Lists What is a list?
-
22 cardsPREP Memory Management - C#
-
72 cardsData Structures Final Which data structure requires more than constant average time for insertions.
-
28 cardsExam 1 Data type and examples
-
20 cardsData Structure represents the overall resource of the organization.
-
14 cards4.2.8 Vectors