|
Path to deepest 1 in a binary tree........
Software QA/Tests Interview Questions from Microsoft
(Continued from previous question...)
Path to deepest 1 in a binary tree........
Q:
Microsoft Interview Question for Software Engineer in Tests about Algorithm
Path to deepest 1 in a binary tree.
We have a binary tree (not a BST) made up of only 0s and 1s. we need to find the deepest 1 with a path from root made up only of 1's.
(Continued on next question...)
Other Interview Questions
| 