關於這本電子書
A search tree is a tree data structure that is used in the field of computer science for the purpose of locating specific keys from within a collection. The key for each node in a tree needs to be greater than any keys in subtrees on the left, and it needs to be less than any keys in subtrees on the right for the tree to be able to function as a search tree.
How You Will Benefit
(I) Insights, and validations about the following topics:
Chapter 1: Search Tree
Chapter 2: Binary Search Tree
Chapter 3: Self-Balancing Binary Search Tree
Chapter 4: Red-Black Tree
Chapter 5: B-Tree
Chapter 6: Splay Tree
Chapter 7: Tries
Chapter 8: AVL Tree
Chapter 9: 2-3 Tree
Chapter 10: Treap
(II) Answering the public top questions about search tree.
(III) Real world examples for the usage of search tree in many fields.
(IV) 17 appendices to explain, briefly, 266 emerging technologies in each industry to have 360-degree full understanding of search tree' technologies.
Who This Book Is For
Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of search tree.
