Archives: 2019/7 | Liang Tan's Blog

Never really desperate, only the lost of the soul.

Liang Tan

2019

1. Problem DescriptionWe are given a binary tree (with root node root), a target node, and an integer value K. Return a

2019-07-16 Liang Tan

Recursion Data Structure and Algorithm Tree Undirected Graph Breath-First Search(BFS) Queue

1. Problem DescriptionIn an infinite binary tree where every node has two children, the nodes are labelled in row order.

2019-07-02 Liang Tan

Recursion Data Structure and Algorithm Complete Binary Tree ZigZag Math

Problem DescriptionWe have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1]. We want

2019-07-02 Liang Tan

Data Structure and Algorithm Dynamic programming backtracking Depth-first Search (DFS) memorization