20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Ninth Week Summary of Key Concepts A heap is a complete binary tree in which each element is greater than or equal to both of its children. Adding an element to a hea…
20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Seventh Week Summary of Key Concepts A tree is a nonlinear structure whose elements are organized into a hierarchy. The order of a tree specifies the maximum number o…
20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Eleventh Week Summary of Key Concepts In hashing, elements are stored in a hash table, with their location in thetable determined by a hashing function. The situation…
20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Tenth Week Summary of Key Concepts An undirected graph is a graph where the pairings representing the edges are unordered. Two vertices in a graph are adjacent if the…
20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Eighth Week Summary of Key Concepts A binary search tree is a binary tree in which, for each node, the elements in the left subtree are less than the parent, and the…
版权声明:欢迎查看本博客.希望对你有有所帮助 https://blog.csdn.net/cqs_2012/article/details/24880735 the longest distance of a binary tree 个人信息:就读于燕大本科软件project专业 眼下大三; 本人博客:google搜索"cqs_2012"就可以; 个人爱好:酷爱数据结构和算法,希望将来从事算法工作为人民作出自己的贡献; 博客内容:the longest distance of a bi…
