Algo-Tree:Algo-Tree是算法和数据结构的集合，这些都是有效代码和良好软件设计的基础。要成为一名优秀的程序员，就需要创建和设计出色的算法。它包含各种语言的解决方案，例如C ++，Python和Java-源码

tree linked-list stack queue

藻树 :evergreen_tree: Algo-Tree是算法和数据结构的集合，这些都是有效代码和良好软件设计的基础。要成为一名优秀的程序员，就需要创建和设计出色的算法。它包含各种语言的解决方案，例如C++ ， Python和Java 。代码结构演算法贡献准则 :gear: 您可以遵循以下准则并做出相应的贡献：确保不从外部来源（例如GFG，hackerearth等）复制代码，因为不会考虑该工作。严禁抄袭。您只能处理分配给您的问题。如果您想为现有算法做出贡献，我们建议您在进行PR之前先创建一个问题，然后将PR链接到该问题。如果您修改/添加了代码，请在提交之前确保代码已编译。严格在文件名中使用snake_case（下划线分隔），并将其推入正确的文件夹中。不要更新。代码库准则：使用4个空格缩进。在代码开头，使用多行注释添加算法描述。在新行中向代码添加注释，并使用单行注释以及4

文件下载

资源详情

[{"title":"（ 57 个子文件 51KB ） Algo-Tree:Algo-Tree是算法和数据结构的集合，这些都是有效代码和良好软件设计的基础。要成为一名优秀的程序员，就需要创建和设计出色的算法。它包含各种语言的解决方案，例如C ++，Python和Java-源码","children":[{"title":"Algo-Tree-main","children":[{"title":"Trie","children":[{"title":"readme.md <span style='color:#111;'> 382B </span>","children":null,"spread":false}],"spread":true},{"title":"Queue","children":[{"title":"readme.md <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false}],"spread":true},{"title":"Algorithm","children":[{"title":"Recursion","children":[{"title":"readme.md <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false}],"spread":true},{"title":"Hashing","children":[{"title":"readme.md <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false}],"spread":true},{"title":"Greedy","children":[{"title":"readme.md <span style='color:#111;'> 533B </span>","children":null,"spread":false}],"spread":true},{"title":"Searching_Sorting","children":[{"title":"readme.md <span style='color:#111;'> 3.09KB </span>","children":null,"spread":false}],"spread":true},{"title":"DP","children":[{"title":"readme.md <span style='color:#111;'> 2.37KB </span>","children":null,"spread":false}],"spread":true},{"title":"Number_theory","children":[{"title":"readme.md <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false}],"spread":true},{"title":"Special_algo","children":[{"title":"readme.md <span style='color:#111;'> 17B </span>","children":null,"spread":false}],"spread":true},{"title":"Bit_manipulation","children":[{"title":"readme.md <span style='color:#111;'> 3.08KB </span>","children":null,"spread":false}],"spread":true},{"title":"Backtracking","children":[{"title":"readme.md <span style='color:#111;'> 2.05KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"2D_Array","children":[{"title":"readme.md <span style='color:#111;'> 837B </span>","children":null,"spread":false}],"spread":true},{"title":"Graph","children":[{"title":"readme.md <span style='color:#111;'> 1.02KB </span>","children":null,"spread":false}],"spread":true},{"title":"Tree","children":[{"title":"readme.md <span style='color:#111;'> 1.85KB </span>","children":null,"spread":false}],"spread":true},{"title":"LICENSE <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"Heap","children":[{"title":"readme.md <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false}],"spread":true},{"title":"Stack","children":[{"title":"readme.md <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false}],"spread":true},{"title":"Array","children":[{"title":"readme.md <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 5.63KB </span>","children":null,"spread":false},{"title":"Code","children":[{"title":"Java","children":[{"title":"factorial.java <span style='color:#111;'> 728B </span>","children":null,"spread":false},{"title":"readme.md <span style='color:#111;'> 29B </span>","children":null,"spread":false}],"spread":true},{"title":"Python","children":[{"title":"readme.md <span style='color:#111;'> 31B </span>","children":null,"spread":false}],"spread":false},{"title":"C++","children":[{"title":"permutation_of_a_string.cpp <span style='color:#111;'> 638B </span>","children":null,"spread":false},{"title":"heap_class.cpp <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false},{"title":"BFS.cpp <span style='color:#111;'> 2.04KB </span>","children":null,"spread":false},{"title":"print_subsets.cpp <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false},{"title":"stack_class.cpp <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false},{"title":"Topological_sort.cpp <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"gcd.cpp <span style='color:#111;'> 449B </span>","children":null,"spread":false},{"title":"DFS.cpp <span style='color:#111;'> 1.59KB </span>","children":null,"spread":false},{"title":"searching_in_bst.cpp <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false},{"title":"tower_of_hanoi.cpp <span style='color:#111;'> 2.25KB </span>","children":null,"spread":false},{"title":"kadane_algo.cpp <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"merge_sort.cpp <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"insertion_in_linked_list.cpp <span style='color:#111;'> 2.61KB </span>","children":null,"spread":false},{"title":"fibonacci.cpp <span style='color:#111;'> 375B </span>","children":null,"spread":false},{"title":"check_prime.cpp <span style='color:#111;'> 796B </span>","children":null,"spread":false},{"title":"insertion_sort.cpp <span style='color:#111;'> 1.30KB </span>","children":null,"spread":false},{"title":"insertion _at_end.cpp <span style='color:#111;'> 864B </span>","children":null,"spread":false},{"title":"fibonacci_dp.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"wave_print.cpp <span style='color:#111;'> 687B </span>","children":null,"spread":false},{"title":"insertion_at_start.cpp <span style='color:#111;'> 583B </span>","children":null,"spread":false},{"title":"spiral_print.cpp <span style='color:#111;'> 975B </span>","children":null,"spread":false},{"title":"knapsack.cpp <span style='color:#111;'> 2.95KB </span>","children":null,"spread":false},{"title":"rabin_karp.cpp <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"longest_subarray_with_sum_k.cpp <span style='color:#111;'> 882B </span>","children":null,"spread":false},{"title":"factorial.cpp <span style='color:#111;'> 397B </span>","children":null,"spread":false},{"title":"Dijkstra.cpp <span style='color:#111;'> 2.45KB </span>","children":null,"spread":false},{"title":"quick_sort.cpp <span style='color:#111;'> 2.16KB </span>","children":null,"spread":false},{"title":"heap_sort.cpp <span style='color:#111;'> 2.72KB </span>","children":null,"spread":false},{"title":"searching_a_word_in_trie.cpp <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"Kruskal.cpp <span style='color:#111;'> 3.88KB </span>","children":null,"spread":false},{"title":"readme.md <span style='color:#111;'> 28B </span>","children":null,"spread":false},{"title":"queue_using_stacks.cpp <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false}],"spread":false}],"spread":true},{"title":"string","children":[{"title":"readme.md <span style='color:#111;'> 909B </span>","children":null,"spread":false}],"spread":true},{"title":"Linked_list","children":[{"title":"readme.md <span style='color:#111;'> 923B </span>","children":null,"spread":false}],"spread":false},{"title":"CODE_OF_CONDUCT.md <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]

评论信息

其他资源

免责申明

【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论【只为小站】经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见版权及免责申明