| 94 Binary Tree Inorder Traversal |
中序遍歷 |
維護棧，push_l.else_pop_r |
| 95 Unique Binary Search Trees II |
升序數組可生成的BST數組[m] |
遞歸 |
| 96 Unique Binary Search Trees |
有序數組可生成的BST個數[m] |
動態(tài)規(guī)劃 |
| 98 Validate Binary Search Tree |
是否 BST[m] |
遞歸.中序遍歷 |
| 99 Recover Binary Search Tree |
恢復BST[h] |
中序遍歷_交換 |
| 100 Same Tree |
兩個樹是否是同一個樹[e] |
遞歸 |
| 101 Symmetric Tree |
二叉樹是否對稱[e] |
遞歸 |
| 102 Binary Tree Level Order Traversal |
層序遍歷[m] |
隊列實現 |
| 103 Binary Tree Zigzag Level Order Traversal |
z形層序遍歷[m] |
偶數行翻轉 |
| 104 Maximum Depth of Binary Tree |
二叉樹深度[e] |
遞歸 |
| 105 Construct Binary Tree from Preorder and Inorder Traversal |
根據前序遍歷和中序遍歷構造二叉樹[m] |
遞歸實現 |
| 106 Construct Binary Tree from Inorder and Postorder Traversal |
中序和后序遍歷重建二叉樹[m] |
遞歸 |
| 107 Binary Tree Level Order Traversal II |
底部層序遍歷[e] |
層序遍歷后翻轉一下 |
| 108Convert Sorted Array to Binary Search Tree |
升序數組轉換成高度平衡 BST[e] |
遞歸_切分 |
| 109 Convert Sorted List to Binary Search Tree |
|
|
| 110 Balanced Binary Tree |
是否平衡二叉樹[e] |
遞歸 |
| 111 Minimum Depth of Binary Tree |
二叉樹最小深度[e] |
遞歸 |
| 112Path Sum |
是否根節(jié)點到葉節(jié)點所有數字和等于給定值[e] |
遞歸 |
| 113 Path Sum II |
和為指定值的二叉樹路徑數組[m] |
回溯pop |
| 114 Flatten Binary Tree to Linked List |
攤平 BST |
左子樹右子節(jié)點=根節(jié)點右節(jié)點 |
| 116 Populating Next Right Pointers in Each Node |
二叉樹next指向右邊節(jié)點[m] |
遞歸 |
| 117 Populating Next Right Pointers in Each Node II |
沒有通過 |
遞歸實現 |
| 124 Binary Tree Maximum Path Sum |
二叉樹最大路徑和 [h] |
遞歸,r_r.val+max |
| 144 Binary Tree Preorder Traversal |
前序遍歷 |
維護棧拍摇，pop_r_l |
| 145 Binary Tree Postorder Traversal |
后序遍歷 |
維護棧亮钦，pop_unshift_l_r |
| 199 Binary Tree Right Side View |
二叉樹右視圖[m] |
層序遍歷 |
| 226 Invert Binary Tree |
二叉樹翻轉[e] |
遞歸實現與迭代實現 |
| 129 Sum Root to Leaf Numbers |
所有根節(jié)點到葉子節(jié)點組成的數字之和[m] |
深度優(yōu)先遍歷& 回溯 |
| 173 Binary Search Tree Iterator |
二叉搜索樹迭代器[m f101] |
中序遍歷或者generator實現 |
| 236 Lowest Common Ancestor of a Binary Tree |
最近公共祖先[m] |
判決條件_dfs |
| 297 Serialize and Deserialize Binary Tree |
二叉樹序列化與反序列化[h] |
bfs_輸出字符串_轉成樹 |
| 450 Delete Node in a BST |
刪除二叉樹的節(jié)點[m] |
前驅_后繼節(jié)點遍歷 |
| 543 Diameter of Binary Tree |
二叉樹的直徑[m] |
dfs 遞歸 |
| 700 Search in a Binary Search Tree |
bst查找元素[e] |
遞歸/迭代 |
