Tag: tree algorithms

Teaching Kids Programming: Videos on Data Structures and Algorithms Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path …

Teaching Kids Programming: Videos on Data Structures and Algorithms Remove a node (and nodes belong to that subtree) from a Tree is the same as The Process Killing Algorithms …

Given a binary tree root, remove all nodes with only one child. Constraints n ≤ 100,000 where n is the number of nodes in root Example 1 Input root …

Given a sorted list nums of size n, construct a binary search tree by Taking nums as the root where k = floor(n / 2). Recursively constructing the left …

Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all …