10 docs tagged with "trees"

An overview of AVL trees, their properties, and operations.

A comprehensive guide to deleting keys from a B-Tree, covering leaf deletion, internal node deletion, borrowing from siblings, and node merging.

An Expression Tree is a binary tree representing expressions with operators as internal nodes and operands as leaves.

Heavy-Light Decomposition breaks a tree into chains so that path queries and updates can be answered in O(log^2 n) using a Segment Tree.

1. Easy Level

In this post, we'll provide a list of curated practice problems on Trees from platforms like LeetCode and GeeksforGeeks. Trees are fundamental data structures in computer science, and practicing these problems will help strengthen your understanding of tree concepts and algorithms.

Segment Trees are used for efficient range queries.

A guide to splay tree insertion using zig, zig-zig, and zig-zag rotations with amortized O(log n) time complexity using the potential method analysis.

An in-depth guide to tree data structures, covering types of trees, traversal methods, balancing, and algorithms with implementations.

This document provides an overview of various types of trees in computer science. Understanding these tree types is essential for selecting the right data structure for your specific needs.