Source: Wikipedia. Pages: 97. Chapters: AVL tree, Binary expression
tree, Binary search tree, Binary tree, Cartesian tree, Huffman
coding, Left-child right-sibling binary tree, Order statistic tree,
Random binary tree, Red-black tree, Rope (computer science),
Scapegoat tree, Segment tree, Self-balancing binary search tree,
Skew heap, Splay tree, Stack tree, T-tree, Tango tree, Threaded
binary tree, Top tree, Treap, Tree rotation, Weight-balanced tree.
Excerpt: 213 article summaries including: A Comparison of Random
Binary Tree Generators . 3 The abelian sandpile model on a random
binary tree . 4 Topological self-similarity on the random
binary-tree model . The abelian sandpile model on a random binary
tree . 7 Numerical Approach to Central Limit Theorem for
Bifurcation Ratio of Random Binary Tree . Binary Search Tree .
Bidirectional Huffman Coding . A Speculation-Friendly Binary Search
Tree . Asymmetry in Binary Search Tree Update Algorithms . Random
Binary Search Tree with Equal Elements . A quantum analog of
Huffman coding . 18 $D$-ary Bounded-Length Huffman Coding . 19 A
quantum analog of Huffman coding . 20 Difference-Huffman Coding of
Multidimensional Databases . Membandingkan Huffman Coding dengan
Arithmetic Coding . Results on Huffman coding for infinite sources
. Huffman coding with unequal letter costs . Construction of FP
Tree using Huffman Coding . Wikibooks: Data Coding Theory/Huffman
Coding . Segmented Vertex Chain Coding with Huffman Coding . Web
Page Compression using Huffman Coding Technique . An Investigation
and Implementation of Some Binary Search Tree Algorithms .
Evaluation of piecewise affine control via binary search tree . 33
Almost sure asymptotics for the random binary search tree . 34
Connecting Yule Process, Bisection and Binary Search Tree via
Martingales . Almost sure asymptotics for the random binary search
tree . The suffix binary search tree and suffix AVL tree . On
Finding the Height of a Binary Search Tree . Connecting Yule
Process, Bisection and Binary Search Tree via Martingales . Mining
Frequent Itemsets by using Binary Search Tree Approach .
Pseudo-balanced binary trees . Locally balanced binary trees .
Penyempurnaan Dan Implementasi Software Kompresi Multi Tahap
Menggunakan Huffman Coding . Huffman Coding Untuk Kompresi Data
Teks Berbahasa Indonesia . KOMPRESI SHORT MESSAGE SERVICE
MENGGUNAKAN HUFFMAN CODING DAN PERULANGAN BIGRAM . 46 Huffman
Coding with Letter Costs: A Linear-Time Approximation Scheme .
Fractal Image Compression Using Quadtree Decomposition and Huffman
Coding . 48 Huffman Coding as a Non-linear Dynamical System . 49 A
Dynamic Programming Approach To Length-Limited Huffman Coding .
Scan test data compression using alternate Huffman coding . Low
Power Huffman Coding for High Performance Data Transmission .
Secure Message Transmission using Lagrange Polynomial Interpolation
and Huffman Coding . A Huffman Coding Section-based Steganography
for AAC Audio . Ternary Tree and Clustering Based Huffman Coding
Algorithm . Wikibooks: JPEG - Idea and Practice/The Huffman coding
. Computation and approximation of piecewise affine control via
binary search tree . 60 An O(loglog n)-Competitive Binary Search
Tree with Optimal Worst-Case Access Times . An Adaptive Indexed
Binary Search Tree for Efficient Homomorphic Coercion Resistant
Voting Scheme . 62 Binary Search Tree insertion, the Hypoplactic
insertion, and Dual Graded Graphs . PEMBENTUKAN BINARY SEARCH TREE
PADA DA...
