Java

Share an insight from having analyzed your colleagues posting and application.

Or Offer your opinion and possible alternatives for solution details.

Or Evaluate and validate an idea with your own experience.

Or Make a suggestion and expand on below Java Share an insight from having analyzed your colleagues posting and application.

Or Offer your opinion and possible alternatives for solution details.

Or Evaluate and validate an idea with your own experience. Or Make a suggestion and expand on below

A data tree is one of the data structures that are used in organizing data. With the binary tree being the basic form, data tree has an inherent hierarchy and looks like an inverted tree. From the root, the nodes or vertices branch out until a leaf is reached (Sherrod, 2007). This data structure is similar to the tree directory structure, which is the most popular as it is used in Windows and Linux operating system (Tree structured directories, 2013). The data trees that are compared in this discussion are the segment tree and suffix tree.

A segment tree is a binary tree that is implemented when a number of queries such as minimum, maximum, sum, and producthave to be made to a set of numerical values contained in an array. The array elements are represented by the leaves and these values are traversed in postorder. This process adds the values of two children nodes such that the parent nodes represent the sum. Each parent node is labeled with the interval of the indices of array elements that are added to get the sum at the parent node (Smit, n.d.).

A suffix tree is a compressed trie of all suffixes in a text and is used primarily in finding all instances of a pattern. It can also search for the longest repeated substring, the longest common substring, and the longest palindrome in a string. The search requires the preprocessing of the text in order to allow a search through time linear as a function of pattern length. Examples of pattern searching algorithms that use an amount of time proportional to the text length are KMP and Z. The advantage of using a suffix tree in Ctrl + F function is due to the pattern length that is typically shorter than the text length. A suffix tree is a non-binary tree with nodes that represent all the suffixes in the given text. The compressed trie is built with the suffixes that are considered as individual words