binary search tree

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. Wikipedia

Books for Learning

Chapters on Binary Search Tree and Microprocessor-Microcontroller

Binary Search Tree (BST) is a node-based binary tree data structure. It is one of the most widely used techniques for searching in non-linear data structure. Microprocessor and Microcontroller is a part of computer that plays an important role in today's technology. Reading these chapters will equip the readers with a summarized understanding of Binary Search Tree (BST) using C-Language and current trends on Microprocessor and Microcontroller

Advanced Algorithms and Data Structure

Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing

Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology

Traditionally an area of study in computer science, string algorithms have, in recent years, become an increasingly important part of biology, particularly genetics. This volume is a comprehensive look at computer algorithms for string processing. In addition to pure computer science, Gusfield adds extensive discussions on biological problems that are cast as string problems and on methods developed to solve them. This text emphasizes the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatic