Know Thyself
  • Blogs
  • Outlines
    Algorithms Projects Coding Reading Essays
  • About Me
  • Search

Understanding


This is where I write down drafts for learning

116. Populating Next Right Pointers in Each Node

Medium

Posted on November 5, 2019

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: [Read More]
Tags: Coding LeetCode DFS BFS Medium

114. Flatten Binary Tree to Linked List

Medium

Posted on November 5, 2019

Given a binary tree, flatten it to a linked list in-place. [Read More]
Tags: Coding LeetCode DFS Medium

106. Construct Binary Tree from Inorder and Postorder Traversal

Medium

Posted on October 31, 2019

Description [Read More]
Tags: Coding LeetCode Medium DFS Tree

105. Construct Binary Tree from Preorder and Inorder Traversal

Medium

Posted on October 28, 2019

Description [Read More]
Tags: Coding LeetCode Medium DFS Tree

Sort Algorithms

排序算法

Posted on October 27, 2019

Table of Contents [Read More]
Tags: Coding Sort

刷题代码模板

Posted on October 26, 2019

  对于难题,先想出来 Brute Force 怎么做啊!在刷题的时候先把 BF 的写出来! [Read More]
Tags: Coding LeetCode
  • ← Newer Posts
  • Older Posts →
  • RSS
  • Email me
  • Facebook
  • GitHub
  • Twitter

gitlinux  •  2022

Total views.