DSA: Binary search

Trie in DSA

In binary trees, the views and types refer to different perspectives and classifications of the tree structure. Types of Views in Binary Tree are : Horizontal View: The horizontal view of a binary tree shows the nodes from left to right at each level. Nodes at the same level are listed in the order of their […]

Trie in DSA

What is Searching? Searching is a fundamental process in computer science that is commonly used to locate certain items or values within a data structure. Depending on the qualities of the data and the specific requirements of the search, different data formats and algorithms are used for searching. What is Binary Search in DSA? Binary […]