# Category:Binary trees

Computing portal |

Here is a list of articles in the Binary trees category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Binary trees"

The following 30 pages are in this category, out of 30 total.

- Binary tree
*(computing)*

### A

- AVL tree
*(computing)*

### B

- Binary expression tree
*(computing)* - Binary heap
*(computing)* - Binary search tree
*(computing)* - Binary space partitioning
*(computing)*

### C

- Cartesian tree
*(computing)*

### G

- Garsia–Wachs algorithm
*(computing)* - Geometry of binary search trees
*(computing)*

### H

- Huffman coding
*(computing)*

### I

- Interleave lower bound
*(computing)*

### L

- Left-child right-sibling binary tree
*(computing)*

### O

- Optimal binary search tree
*(computing)*

### R

- Random binary tree
*(computing)* - Red–black tree
*(computing)* - Rope (data structure)
*(computing)* - Rotation distance
*(computing)*

### S

- Scapegoat tree
*(computing)* - Segment tree
*(computing)* - Self-balancing binary search tree
*(computing)* - Skew heap
*(computing)* - Splay tree
*(computing)*

### T

- T-tree
*(computing)* - Tango tree
*(computing)* - Threaded binary tree
*(computing)* - Top tree
*(computing)* - Treap
*(computing)* - Tree rotation
*(computing)*

### V

- Vantage-point tree
*(computing)*

### W

- WAVL tree
*(computing)*