mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-10-31 18:37:48 +08:00 
			
		
		
		
	 9900e0c668
			
		
	
	9900e0c668
	
	
	
		
			
			* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element. * fix(codes/cpp): Fix access error when printArray(arr, 0) * Update PrintUtil.hpp * fix(codes/c): Fix some errors of cmake build * feat(codes/c): Add hashing_search.c * styles(codes/c): Modify function description * styles(codes/c): Modify binary_search.c code style * fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released. * feat: Add preorder_traversal_i_compact.c * feat(codes/c): Add head_sort.c * feat(codes/c): Add bucket_sort.c * feat(codes/c): Add binary_search_edge.c * fix(codes/c): Add programs that are not managed by cmake (c code) * feat(codes/c): Add selection_sort.c * style(codes/c): Change swap in selection_sort.c to `selectionSort` * styles(codes/c): Change style. * fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters * fix(codes/c): Fix space_complexity.c build error. * feat(codes/c): Add array_binary_tree.c * feat(code/c): Update push_back and pop_back in vector.h * styles(codes/c): Adjust format. --------- Co-authored-by: Yudong Jin <krahets@163.com>
		
			
				
	
	
		
			7 lines
		
	
	
		
			288 B
		
	
	
	
		
			CMake
		
	
	
	
	
	
			
		
		
	
	
			7 lines
		
	
	
		
			288 B
		
	
	
	
		
			CMake
		
	
	
	
	
	
| add_executable(avl_tree avl_tree.c)
 | |
| add_executable(binary_tree binary_tree.c)
 | |
| add_executable(binary_tree_bfs binary_tree_bfs.c)
 | |
| add_executable(binary_tree_dfs binary_tree_dfs.c)
 | |
| add_executable(binary_search_tree binary_search_tree.c)
 | |
| add_executable(array_binary_tree array_binary_tree.c)
 |