Name		Name	Last commit message	Last commit date
0_assets		0_assets
10_dp		10_dp
12_pq&heap		12_pq&heap
1_array_and_hashing		1_array_and_hashing
2_binary_search		2_binary_search
2_sortings		2_sortings
2_two_pointers		2_two_pointers
3_stack_and_queue		3_stack_and_queue
4_sliding_window		4_sliding_window
5_linked_list		5_linked_list
6_trees		6_trees
7_recursion		7_recursion
9_graphs		9_graphs
leetcode_notes		leetcode_notes
.DS_Store		.DS_Store
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md

Repository files navigation

Leetcode Grind

Tree

Todo

DFS inorder, postorder Traversal
BFS inorder, postorder Traversal
Figure Lambda function in 314. Binary Tree Vertical Order Traversal

# A lambda function that adds 10 to its argument
add_ten = lambda x: x + 10
print(add_ten(5))  # Output: 15

About

Algorithm learning hub : show case the fundamental algorithms like sorting algorithms, such as generic sort, merge sort, quick sort, bucket sort, and radix sort, etc.

algorithms binary-search-tree computer-science data-structures leetcode sorting-algorithms tree

2 stars

1 watching

Report repository

Releases

Packages

Used by

Contributors

Languages