Tag: DFS algorithm

Teaching Kids Programming: Videos on Data Structures and Algorithms Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the number of …

Given a binary tree root and an integer target, delete all the leaf nodes with value target. Note that once you delete a leaf node with value target, if …

Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf …