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
01 Discrete Math
> 11.3 Tree traversal > Flashcards
11.3 Tree traversal Flashcards
Study These Flashcards
01 Discrete Math
(35 decks)
The foundations: logic and proof
Chapter one, Revision Examples.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.4 Sequences and Summations
2.5 Cardinality of Sets
2.6 Matrices
9.1 Relations and their properties
9.2 n-ary Relations and their Applications
9.3 Representing Relations
9.4 Closure Of Relations
3.1 Algorithms
Appendix 3 Pseudocode:
3.2 The growth of functions
3.3 Complexity Of Algorithms
4.1 Divisibility and Modular Arithmetic
4.2 Integer Representations and Algorithms
4.3 Primes and Greatest Common Divisors
4.4 Solving Congruences
4.5 Applications of Congruences
4.6 Cryptography
5.1 Mathematical Induction
9.5 Equivalence Relations
9.6 Partial Orderings
10.1 Graphs and Graph Models
10.2 Graph Terminology and Special Types of Graphs
10.3 Representing Graphs and Graph Isomorphism
10.4 Connectivity
10.5 Euler and Hamilton Paths
10.6 Shortest-Path Problems
10.7 Planar Graphs
10.8 Graph Coloring
11.1 Introduction to trees
11.2 Applications of Trees
11.3 Tree traversal
6.3 Permutations and Combinations
