Patterns

Fundamentals/DFS on Trees

← Prev Next →

Given the root of a binary tree, return the maximum value found in the tree using DFS.

Compare with siblingPattern: Tree — DFS (Recursive) →

Pattern siblings

downhill
balanced_binary_tree
closest_bst_values_ii
flatten_binary_tree
insert_into_bst
invert_binary_tree
kth_smallest_number_in_bst
lowest_common_ancestor
lowest_common_ancestor_on_bst
serializing_tree
subtree_with_maximum_average
tree_dp_intro
tree_max_depth
valid_bst
visible_tree_node
dfs_intro
dfs_on_trees_introcurrent
dfs_with_states
highest_tenure
diameter_of_binary_treeeasy
maximum_depth_of_binary_treeeasy
same_treeeasy
subtree_of_another_treeeasy
sum_of_left_leaveseasy
validate_binary_search_treemedium
house_robber_iiimedium

Check siblings above to see their reference solutions side by side.