Depth First Search

Depth First Search #

TitleSolutionDifficultyTimeSpace收藏
98. Validate Binary Search TreeGoMediumO(n)O(1)
99. Recover Binary Search TreeGoHardO(n)O(1)
100. Same TreeGoEasyO(n)O(1)
101. Symmetric TreeGoEasyO(n)O(1)
104. Maximum Depth of Binary TreeGoEasyO(n)O(1)
108. Convert Sorted Array to Binary Search TreeGoEasyO(n)O(1)
109. Convert Sorted List to Binary Search TreeGoMediumO(log n)O(n)
110. Balanced Binary TreeGoEasyO(n)O(1)
111. Minimum Depth of Binary TreeGoEasyO(n)O(1)
112. Path SumGoEasyO(n)O(1)
113. Path Sum IIGoMediumO(n)O(1)
114. Flatten Binary Tree to Linked ListGoMediumO(n)O(1)
124. Binary Tree Maximum Path SumGoHardO(n)O(1)
129. Sum Root to Leaf NumbersGoMediumO(n)O(1)
199. Binary Tree Right Side ViewGoMediumO(n)O(1)
200. Number of IslandsGoMediumO(n^2)O(n^2)
207. Course ScheduleGoMediumO(n^2)O(n^2)
210. Course Schedule IIGoMediumO(n^2)O(n^2)
257. Binary Tree PathsGoEasyO(n)O(1)
394. Decode StringGoMediumO(n)O(n)
515. Find Largest Value in Each Tree RowGoMediumO(n)O(n)
542. 01 MatrixGoMediumO(n)O(1)
980. Unique Paths IIIGoHardO(n log n)O(n)
————————————————————————————————–———————–———–——–

⬅️上一页

下一页➡️

Calendar Sep 6, 2020
Edit Edit this page
本站总访问量:  次 您是本站第  位访问者