If you mean data structures such as trees, sets and more, the importance is the fact that:
They provide patterns for storing data
They serve as basis for algorithms to act on that data
As a theoretical structure in Discreet Math, they have provable properties which can be served in using/optimizing/choosing said data structures and algorithms
As examples, knowing structures from discreet math can help you correctly and reliably and quickly answer questions such as:
What is the best way to store a list of unique objects where your main purpose is deciding whether the object is in the list.
What is the fastest way to search for something in a list
How can I store a list of objects where the size of the list is not known and the data in the list must be retrieved in sorted order.
What's the best way to implement such a thing if you insert data very often and retrieve rarely? Vice versa?
How do I go from address A to address B on a map in a car (think directed graphs of the streets)
NOTE: This answer is specific to structures from Discreet math (trees/graphs/sets/etc...) - the importance of Discreet Math to programming overall has MUCH broader implications, since Discreet math also includes boolean logic (which is the basis for pretty much all of modern digital computing), probability theory, etc...
发布评论
评论（2）
如果您指的是树、集合等数据结构，那么重要的是以下事实：
它们提供存储数据的模式
它们作为算法运行的基础
作为示例，了解离散数学的结构可以帮助您正确和可靠而快速地回答以下问题：
存储唯一对象列表的最佳方法是什么，您的主要目的是确定该对象是否在列表中。
在列表中搜索某些内容的最快方法是什么
如何存储列表大小不小的对象列表已知并且列表中的数据必须按排序顺序检索。
如何从汽车地图上的地址 A 前往地址 B（想象街道的有向图）
请查看有关离散数学的链接维基百科文章 - 它既提供了精彩的总结，也提供了大量的具体细节和示例。
注意：此答案特定于离散数学（树/图/集合/等...）中的结构 - 离散数学对整体编程的重要性具有更广泛的含义，因为离散数学还包括布尔逻辑（这是几乎所有现代数字计算的基础）、概率论等......
If you mean data structures such as trees, sets and more, the importance is the fact that:
They provide patterns for storing data
They serve as basis for algorithms to act on that data
As a theoretical structure in Discreet Math, they have provable properties which can be served in using/optimizing/choosing said data structures and algorithms
As examples, knowing structures from discreet math can help you correctly and reliably and quickly answer questions such as:
What is the best way to store a list of unique objects where your main purpose is deciding whether the object is in the list.
What is the fastest way to search for something in a list
How can I store a list of objects where the size of the list is not known and the data in the list must be retrieved in sorted order.
How do I go from address A to address B on a map in a car (think directed graphs of the streets)
Please review the linked Wikipedia article on Discreet Math - it provides both a great summary as well as a wealth of specific details and examples.
NOTE: This answer is specific to structures from Discreet math (trees/graphs/sets/etc...) - the importance of Discreet Math to programming overall has MUCH broader implications, since Discreet math also includes boolean logic (which is the basis for pretty much all of modern digital computing), probability theory, etc...
无论您在哪个领域工作，这都非常重要。在某种程度上，程序本身是离散的结构。
Very important no matter which area you work in. Programmes themselves are, in a way, discrete structures.