第二个专题是树，今天才刷完，上周被实习郁闷崩了TAT
104. Maximum Depth of Binary Tree : Easy
226 . Invert Binary Tree : Easy
100. Same Tree : Easy
173. Binary Search Tree Iterator : Medium
235. Lowest Common Ancestor of a Binary Search Tree : Easy【值得回顾】
96. Unique Binary Search Trees : Medium
110. Balanced Binary Tree : Easy
124. Binary Tree Maximum Path Sum : Hard
116. Populating Next Right Pointers in Each Node : Medium
108. Convert Sorted Array to Binary Search Tree : Easy
236. Lowest Common Ancestor of a Binary Tree : Medium
101. Symmetric Tree : Easy
297. Serialize and Deserialize Binary Tree : Hard
102. Binary Tree Level Order Traversal : Medium
222. Count Complete Tree Nodes : Medium
112. Path Sum : Easy
105. Construct Binary Tree from Preorder and Inorder Traversal : Medium
257. Binary Tree Paths : Easy
99. Recover Binary Search Tree : Hard 二叉排序树中有两个节点互换了，让找到这两个节点。基本思想是中序遍历，第一个不符合递增的数是左边的值，然后再找右边的。【值得回顾】
114. Flatten Binary Tree to Linked List : Easy
https://leetcode.com/problems/binary-tree-right-side-view/description/ : Medium
网友评论