Leetcode Depth-first Search
关注
分享
扫一扫
文章平均质量分 67
Niko_Ke
EE狗转CS
展开
-
Leetcode 257. Binary Tree Paths (Easy) (cpp)
Leetcode 257. Binary Tree Paths (Easy) (cpp)原创 2016-07-23 19:00:08 · 400 阅读 · 0 评论 -
Leetcode 124. Binary Tree Maximum Path Sum (Hard) (cpp)
Leetcode 124. Binary Tree Maximum Path Sum (Hard) (cpp)原创 2016-11-23 13:20:25 · 549 阅读 · 0 评论 -
Leetcode 108. Convert Sorted Array to Binary Search Tree (Medium) (cpp)
Leetcode 108. Convert Sorted Array to Binary Search Tree (Medium) (cpp)原创 2016-11-24 04:34:13 · 376 阅读 · 0 评论 -
Leetcode 129. Sum Root to Leaf Numbers (Medium) (cpp)
Leetcode 129. Sum Root to Leaf Numbers (Medium) (cpp)原创 2016-11-24 04:53:29 · 399 阅读 · 0 评论 -
Leetcode 366. Find Leaves of Binary Tree (Medium) (cpp)
Leetcode 366. Find Leaves of Binary Tree (Medium) (cpp)原创 2016-11-24 06:33:59 · 671 阅读 · 0 评论 -
Leetcode 133. Clone Graph (Medium) (cpp)
Leetcode 133. Clone Graph (Medium) (cpp)原创 2016-12-24 16:23:40 · 575 阅读 · 0 评论 -
199. Binary Tree Right Side View (Medium)
199. Binary Tree Right Side View (Medium)原创 2016-12-26 02:49:25 · 521 阅读 · 0 评论 -
114. Flatten Binary Tree to Linked List (Medium)
114. Flatten Binary Tree to Linked List (Medium)原创 2016-12-26 03:12:25 · 429 阅读 · 0 评论 -
Leetcode 116. Populating Next Right Pointers in Each Node (Medium) (cpp)
Leetcode 116. Populating Next Right Pointers in Each Node (Medium) (cpp)原创 2016-12-27 02:35:57 · 510 阅读 · 0 评论 -
Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)原创 2016-12-27 04:16:57 · 610 阅读 · 0 评论 -
Leetcode 112. Path Sum (Easy) (cpp)
Leetcode 112. Path Sum (Easy) (cpp)原创 2016-07-23 18:39:36 · 517 阅读 · 0 评论 -
Leetcode 113. Path Sum II (Medium) (cpp)
Leetcode 113. Path Sum II (Medium) (cpp)原创 2016-11-22 03:46:01 · 581 阅读 · 0 评论 -
Leetcode 100. Same Tree (Easy) (cpp)
Leetcode 100. Same Tree (Easy) (cpp)原创 2016-07-22 14:48:43 · 353 阅读 · 0 评论 -
Leetcode 101. Symmetric Tree (Easy) (cpp)
Leetcode 101. Symmetric Tree (Easy) (cpp)原创 2016-07-22 14:29:58 · 363 阅读 · 0 评论 -
Leetcode 104. Maximum Depth of Binary Tree (Easy) (cpp)
Leetcode 104. Maximum Depth of Binary Tree (Easy) (cpp)原创 2016-07-22 16:50:04 · 467 阅读 · 0 评论 -
Leetcode 110. Balanced Binary Tree (Easy) (cpp)
Leetcode 110. Balanced Binary Tree (Easy) (cpp)原创 2016-07-23 18:00:19 · 302 阅读 · 0 评论 -
Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)
Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)原创 2016-07-23 16:21:20 · 658 阅读 · 0 评论 -
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium) (cpp)
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium) (cpp)原创 2016-08-01 18:39:04 · 367 阅读 · 0 评论 -
Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium) (cpp)
Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium) (cpp)原创 2016-08-01 19:21:40 · 300 阅读 · 0 评论 -
Leetcode 109. Convert Sorted List to Binary Search Tree (Medium) (cpp)
Leetcode 109. Convert Sorted List to Binary Search Tree (Medium) (cpp)原创 2016-08-17 10:44:05 · 772 阅读 · 0 评论 -
Leetcode 98. Validate Binary Search Tree (Medium) (cpp)
Leetcode 98. Validate Binary Search Tree (Medium) (cpp)原创 2016-11-21 12:21:35 · 693 阅读 · 0 评论 -
Leetcode 99. Recover Binary Search Tree (Hard) (cpp)
Leetcode 99. Recover Binary Search Tree (Hard) (cpp)原创 2016-12-28 02:42:53 · 477 阅读 · 0 评论