Useful Links
Mathematics
Discrete Mathematics
1. Foundations of Logic and Proofs
2. Set Theory and Basic Structures
3. Combinatorics
4. Number Theory
5. Graph Theory
6. Trees
7. Discrete Probability
8. Algorithms and Complexity
9. Boolean Algebra and Logic Circuits
Trees
Tree Fundamentals
Definition and Properties
Acyclic Connected Graphs
Equivalent Definitions
Basic Properties
Tree Terminology
Roots and Leaves
Parents and Children
Siblings and Ancestors
Descendants and Subtrees
Height and Depth
Types of Trees
Rooted Trees
Binary Trees
m-ary Trees
Ordered Trees
Full and Complete Trees
Tree Traversals
Depth-First Traversals
Preorder Traversal
Inorder Traversal
Postorder Traversal
Breadth-First Traversal
Level Order Traversal
Tree Reconstruction
From Traversal Sequences
Unique Reconstruction Conditions
Spanning Trees
Definition and Existence
Spanning Tree Properties
Number of Spanning Trees
Minimum Spanning Trees
Weight and Cost
Optimality Conditions
Uniqueness Conditions
Algorithms for MST
Kruskal's Algorithm
Prim's Algorithm
Comparison of Algorithms
Tree Applications
Binary Search Trees
Structure and Properties
Search Operations
Insertion and Deletion
Expression Trees
Arithmetic Expressions
Evaluation Methods
Construction from Expressions
Decision Trees
Structure and Applications
Optimization Problems
Huffman Coding
Optimal Prefix Codes
Huffman Algorithm
Applications in Compression
Previous
5. Graph Theory
Go to top
Next
7. Discrete Probability