* "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>
* feat: tranlating n_queens.c
* Reference to c++ code with additional comments
* Update n_queens.c
* Update n_queens.c
* Format n_queens.c
* Update n_queens.c
keep the file header information format consistent with others
* fine tune
* fine tune
* Delete mkdocs-en.yml
* Update README.md
---------
Co-authored-by: krahets <krahets@163.com>
* Modify method name to PascalCase(array and linked list)
* Modify method name to PascalCase(backtracking)
* Modify method name to PascalCase(computational complexity)
* Modify method name to PascalCase(divide and conquer)
* Modify method name to PascalCase(dynamic programming)
* Modify method name to PascalCase(graph)
* Modify method name to PascalCase(greedy)
* Modify method name to PascalCase(hashing)
* Modify method name to PascalCase(heap)
* Modify method name to PascalCase(searching)
* Modify method name to PascalCase(sorting)
* Modify method name to PascalCase(stack and queue)
* Modify method name to PascalCase(tree)
* local check