Problem#8 :Unival Subtrees

All problems are from https://www.dailycodingproblem.com/

 

Solution Codes : https://github.com/Kusin/DailyCoding

Kusin/DailyCoding

Daily Coding Problem#8 :Unival Subtrees

Problem Description

 

Solution

Time Complexity : O(N)

Space Complexity : O(N)

SVG File! You can click the image and Magnify it as much as you can.

 

Sorting at level 1 can be done by traversing level order at the given tree. So O(N)