鐵人檔案
這次想透過練習 blind 75 ，來整理過去學過的演算法與資料結構
主要會有幾個方向：
1. 圖解的方式來做練習。
2. 分析解題其中的時間與空間複雜度。
3. 預計會使用 golang 作為解題的語言。
4. 寫下卡關遇到的難題。
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked...
Tree 資料結構解析 Tree Tree(樹) 是一種非線性階層式排列資料結構，因為具有樹狀結構，看起來像一個倒過來生長的樹。 樹狀結構的基本資料存儲單位是節...
Same Tree Given the roots of two binary trees p and q, write a function to check...
Subtree of Another Tree Given the roots of two binary trees root and subRoot, re...
Invert Binary Tree Given the root of a binary tree, invert the tree, and return ...
Maximum Depth of Binary Tree Given the root of a binary tree, return its maximum...
Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST),...
Kth Smallest Element in a BST Given the root of a binary search tree, and an int...
Validate Binary Search Tree Given the root of a binary tree, determine if it is...
Binary Tree Level Order Traversal Given the rootof a binary tree, return the lev...