Input enhancement (computer science): Difference between revisions

Revision as of 01:58, 30 November 2021

Revision as of 10:47, 11 September 2023

Line 36:

=== In trees ===

Creating data structures to more efficiently search through data is also a form of input enhancement. Placing data into a tree to store and search through inputs is another popular technique. [[Tree (data structure)|Trees]] are used throughout computer science and many different types of trees -{{snd}} [[binary search treestree]]s, [[AVL treestree]]s, [[red-blackred–black treestree]]s, and [[2-32–3 tree]]s to name just a small few -{{snd}} have been developed to properly store, access, and manipulate data while maintaining their structure. Trees are a principal data structure for dictionary implementation.

The benefits of putting data in a tree are great, especially if the data is being manipulated or repeatedly searched through. Binary search trees are the most simplest, yet most common type of tree for this implementation. The insertion, deletion, and searching of items in a tree are all worst case O(''n''), but are most often executed in O(log ''n''). This makes the repeated searching of elements even quicker for large inputs. There are many different types of binary search trees that work more efficiently and even self-balance upon addition and removal of items, like the AVL tree which has a worst case O(log ''n'') for all searching, inserting, and deletion.