Breadth First Search Algorithm to Check Completeness of a Binary Tree?
Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly …
Tag: C++ and Java coding exercise
How to Count Univalue Subtrees in a Binary Tree?
Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree means all nodes of the subtree have the same value. Example : Input: root = 5 …
The Image Smoother Algorithm in C++/Java
Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the …
How to Sum the Root To Leaf in Binary Numbers in a Binary Tree using Breadth First Search?
Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path …
Compute Number of Lines To Write String (Wordwrap)
We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter …