mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-24 10:46:29 +08:00
9562287a21
* "Add Q&A sections to array/linked_list and tree chapters" Added question and answers related to the use of std::list in C++ and space complexity in full binary tree traversal to their respective chapters in array_and_linked_list and tree documentation. * Update summary.md * Update summary.md * Update summary.md * "Expand details on HashTable, arrays, and linked lists in docs" Extended the section explaining how HashTables use both linear and nonlinear data structures. Added Q&A sections addressing common questions on character type size, the static and dynamic nature of array-based data structures, and distinguishing array and linked list from logic and physical perspective. These changes provide clearer understanding for readers. * "Add FAQs to array and linked list docs chapter" Added several Frequently Asked Questions to improve clarity in the arrays and linked list documentation chapter. These questions mainly address the behavior and structure of array initializations, circular array queues, and single-link list node deletion. Providing answers to these can enhance understanding and prevent misconceptions among readers. * Update summary.md * Update summary.md * Update summary.md --------- Co-authored-by: Yudong Jin <krahets@163.com> |
||
|---|---|---|
| .. | ||
| assets/covers | ||
| chapter_appendix | ||
| chapter_array_and_linkedlist | ||
| chapter_backtracking | ||
| chapter_computational_complexity | ||
| chapter_data_structure | ||
| chapter_divide_and_conquer | ||
| chapter_dynamic_programming | ||
| chapter_graph | ||
| chapter_greedy | ||
| chapter_hashing | ||
| chapter_heap | ||
| chapter_introduction | ||
| chapter_preface | ||
| chapter_reference | ||
| chapter_searching | ||
| chapter_sorting | ||
| chapter_stack_and_queue | ||
| chapter_tree | ||
| index.assets | ||
| index.md | ||