![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
L3:Tree到DivideConque到DFS和BFS
sunliuxun
Always Stay out of the Comfort Zone.
展开
-
L3:04 - Balanced Binary Tree
https://oj.leetcode.com/problems/balanced-binary-tree/Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which转载 2014-09-27 08:04:25 · 419 阅读 · 0 评论 -
L3:01 - Binary Tree DFS Traversal
https://oj.leetcode.com/problems/binary-tree-preorder-traversal/Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return转载 2014-09-27 07:59:20 · 347 阅读 · 0 评论 -
L3:02 - Divide & Conquer Algorithm
- Merge Sort- Quick Sort- Most of the Binary Tree Problems !转载 2014-09-27 08:02:06 · 262 阅读 · 0 评论 -
L3:03 - Maximum Depth of Binary Tree
https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/转载 2014-09-27 08:03:09 · 360 阅读 · 0 评论 -
L3:05 - Binary Tree Maximum Path Sum
https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binar转载 2014-09-27 08:06:00 · 317 阅读 · 0 评论 -
L3:06 - Binary Tree DFS Template
Binary Tree DFS template/** * Copyright: NineChapter * - Algorithm Course, Mock Interview, Interview Questions * - More details on: http://www.ninechapter.com/ */Template 1: Traversepubl转载 2014-09-27 08:07:37 · 346 阅读 · 0 评论 -
L3:07 - Binary Tree BFS Traversal
。。转载 2014-09-27 08:08:33 · 296 阅读 · 0 评论 -
L3:08 - Binary Tree Level Order Traversal
https://oj.leetcode.com/problems/binary-tree-level-order-traversal/转载 2014-09-27 08:09:22 · 332 阅读 · 0 评论