Brainscape
Find Flashcards
Make Flashcards
Why It Works
More
Educators
Businesses
Tutors & resellers
Content partnerships
Academy
About
Educators
Teachers & professors
Content partnerships
Tutors & resellers
Businesses
Employee training
Content partnerships
Tutors & resellers
Academy
About
Log In
Get Started
Brainscape's Knowledge Genome
TM
Browse over 1 million classes created by top students, professors, publishers, and experts.
Entrance Exams
Professional Certifications
Foreign Languages
Medical & Nursing
Science
English
Humanities & Social Studies
Mathematics
Law
Vocations
Health & Fitness
Business & Finance
Technology & Engineering
Food & Beverage
Fine Arts
Random Knowledge
See full index
A-level Comp Science
> 42. Trees > Flashcards
42. Trees Flashcards
Study These Flashcards
A-level Comp Science
(38 decks)
37. Queues
38. Lists
39. Stacks
40. Hash tables and dictionaries
41. Graphs
42. Trees
43. Vectors
44. Recursive algorithms
45. Big-O notation
46. Searching and sorting
47. Graph-traversal algorithms
48. Optimisation algorithms
49. Limits of computation
50. Mealy machines
51. Sets
52. Regular expressions
53. The Turing machine
54. Backus-Naur Form
55. Reverse Polish notation
56. Structure of the internet
57. Packet switching and routers
58. Internet security
59. TCP/IP, standard application layer protocols
60. IP addresses
61. Client server model
62. Entity relationship modelling
63. Relational databases and normalisation
64. Introduction to SQL
65. Defining and updating tables using SQL
66. Systematic approach to problem solving
67. Basic concepts of object-oriented programming
68. Object-oriented design principles
69. Functional programming
70. Function application
71. Lists in functional programming
72. Big data
A. Floating point form
B. Adders and D-type flip-flops
