Algorithms to Find Maximum Depth of N-ary Tree (C++)
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 …
Category: DFS
C++ Coding Exercise – Sum of Left Leaves (BFS + DFS + Recursion)
Find the sum of all left leaves in a given binary tree. There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24. …
Break a Sentence into Words (Word Break Algorithms) – DFS, BFS and DP
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given …
Binary Tree Level Order Traversal in C/C++
April 21, 2016
algorithms, BFS, c / c++, DFS, leetcode online judge, programming languages
No Comments
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: 3 / \ 9 20 / …
Depth First Search and Breadth First Search Algorithm to Sum Root to Leave Numbers in Binary Tree
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find …