Tree
A tree is a hierarchical, non-linear data structure consisting of nodes connected by edges, with one node designated as the root and every other node having exactly one parent, forming no cycles. Trees are used to represent hierarchical relationships and support efficient search, insertion, and traversal operations,…
14 resources across 2 libraries
Glossary Terms(5)
Tree
A tree is a hierarchical, non-linear data structure consisting of nodes connected by edges, with one node designated as the root and every other node having ex…
Graph
A graph is a data structure consisting of a set of nodes (vertices) connected by edges, which may be directed or undirected and weighted or unweighted, used to…
Heap
A heap is a specialized tree-based data structure that satisfies the heap property: in a min-heap, every parent node is less than or equal to its children; in…
Queue
A queue is a linear data structure that follows First-In-First-Out (FIFO) ordering: elements are added at the rear (enqueue) and removed from the front (dequeu…
Stack
A stack is a linear data structure that follows Last-In-First-Out (LIFO) ordering: elements are added and removed from the same end, called the top, so the mos…
Study Notes(9)
Visual Tree vs Logical Tree
Understand the difference between WPF's logical tree (the XAML element hierarchy) and its visual tree (the fully expanded rendering hierarchy), and why the dis…
Expression Trees Explained
Learn what expression trees are, how the compiler builds them from lambdas, and how providers like EF Core walk them to generate SQL.
Listeners: View Results Tree and Summary Report
Understand JMeter's two most-used listeners — View Results Tree for per-sample debugging and Summary Report for aggregate metrics — and how to use each without…
Building a Family Tree Solver in Prolog
A hands-on walkthrough of modeling a family tree as Prolog facts and rules, then querying it for relationships like siblings, grandparents, and ancestors.
B-Tree Indexes Explained
Learn how PostgreSQL's default B-tree index works internally and why it is the right choice for equality and range queries.
Minimum Spanning Tree
Learn Kruskal's algorithm for finding a minimum spanning tree that connects all vertices at minimum total edge cost.
Tree Traversals
Systematic methods for visiting every node in a tree, including inorder, preorder, postorder, and level-order.
Database Indexing at Scale
Explains how indexes accelerate queries via data structures like B-trees, and the tradeoffs of adding, maintaining, and choosing indexes on very large tables.
Change Detection and Zone.js
Understand how Angular detects and applies UI updates via Zone.js, how the change detection tree works, and how zoneless change detection with signals changes…