112. Path Sum
题目描述:
給定一個二元樹的根節點 root 和一個整數 targetSum,判斷該樹中是否存在從根節點到葉子節點的路徑,使得這條路...
這一題其實以前就有寫過,只是當時還不知道Two Pointer的解題技巧,也是用迴圈粗暴解決,後來為了想要刻意練習使用Two Pointer技巧,又再重寫一次題...
226. Invert Binary Tree
tags: Easy、Tree
Given the root of a binary tree, invert...
Given an integer array nums sorted in non-decreasing order, remove the duplicat...
145. Binary Tree Postorder Traversal
tags: Easy、Tree
Given the root of a binary...
111. Minimum Depth of Binary Tree
tags: Easy、Tree
Given a binary tree, find its...