Data structures are essential programming tools used to organize and store data. These structures allow programmers to use data more efficiently. With advanced data structures, programmers are able to create more robust structures. Trees are one of the most common advanced data structures. For this Discussion, consider the following questions: What is a data tree? How are data trees used in Java programming?
For this Discussion:
Provide a general explanation of data trees. Then, select two specific types of data trees and compare them. For this Discussion, you should provide at least one type of data tree that has not yet been posted by a colleague.
Discussion 2: Hashtables
Suppose you have a product name without an item number. What programming tool(s) can you use to address the problem? A hashtable provides a quick way to accomplish this task. It allows you to look up items by something other than an index number, such as a letter or String, and provides the related data, such as the index number. While hashtables help increase the speed of look up times, using them significantly reduces the memory storage. For this Discussion, consider a realistic scenario to which hashtables can be applied.
For this Discussion:
Provide an explanation of hashtables, including a description of a realistic scenario that could be solved with the application of a hashtable. Then, compare the purpose and usage of hashtables to JTrees as well as one of the following additional data structures: Arraylist, array, or JList. In your comparison, be sure to include an explanation of one way hashtables are similar to your selected data structure and one way in which they are different.
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.1. Discussion 1:Data structures are essential programming tools used to organize and store data. These structures allow programmers to use data more efficiently. With advanced data structures, programmers are able to create more robust structures. Trees are one of the most common advanced data structures.
a. Provide a general explanation of data trees. And , consider the following questions:
i. What is a data tree?
1. It’s an ADT that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
2. It doesn’t have any cycle, there is only one path between 2 nodes
ii. How are data trees used in Java programming?
1. In Java, there isn’t separated tree implementation but tree is used in extension of map and set ADT.
2. They are TreeMap and TreeSet, they belong to STL...