Software Engineer Notes
1.0
Table of Contents
1. Part I - Introduction
2. Part II - C++ Built-in Data Structure
3. Part III - Advanced Data Structure and Algorithm
3.1. Number System
3.2. Matrix
3.3. Tree
3.3.1. Tree Traversal
3.3.2. Lowest Common Ancestor
3.3.3. Segment Tree
3.3.4. Tournament Tree
3.3.5. AVL Tree
3.3.6. Cord Tree
3.3.7. QuadTree
3.3.8. Questions
3.4. Dynamic Programming
3.5. Computational Geometry
3.6. Math
3.7. Combinatorics
3.8. Graph
3.9. Binary Search
3.10. Concurrency
3.11. Greedy Algorithm
3.12. Approximation Algorithm
3.13. Advanced Data Structure And Algorithm
4. Part IV - Interview
5. Sample
Software Engineer Notes
3.
Part III - Advanced Data Structure and Algorithm
3.3.
Tree
View page source
3.3.
Tree
3.3.1. Tree Traversal
3.3.1.1. Binary Tree Inorder Traversal
3.3.2. Lowest Common Ancestor
3.3.3. Segment Tree
3.3.3.1. Subarray Minimum Query
3.3.3.2. Buddy System Bitmap
3.3.4. Tournament Tree
3.3.4.1. Second Best Player
3.3.5. AVL Tree
3.3.6. Cord Tree
3.3.7. QuadTree
3.3.7.1. Image compression With QuadTree
3.3.7.2. K Nearest Neighbours
3.3.8. Questions
3.3.8.1. Step-By-Step Directions From a Binary Tree Node to Another