1038. Binary Search Tree to Greater Sum Tree

02-13

104. Maximum Depth of Binary Tree

02-13

105. Construct Binary Tree from Preorder and Inorder Traversal

02-13

106. Construct Binary Tree from Inorder and Postorder Traversal

02-13

111. Minimum Depth of Binary Tree

02-13

112. Path Sum

02-13

113. Path Sum II

02-13

114. Flatten Binary Tree to Linked List

02-13

116. Populating Next Right Pointers in Each Node Postorder Traversal

02-13

廣度優先搜尋&深度優先搜尋

02-13