Algorithms and Data Structures

2019-07-07

This post contains notes for common algorithms and data structures.

Graph

Pattern Searching

Rabin–Karp Algorithm

Knuth–Morris–Pratt Algorithm

Boyer–Moore Algorithm

Tree

Traversal

Morris Traversal

Ref: Morris Traversal方法遍历二叉树（非递归，不用栈，O(1)空间）

In order to achieve O(1) space complexity and O(n) time complexity for traversal problem, we could not use recursion and stack+iterative methods. Morris Traversal link last node of subtree traversal to the next node to be traversed (the current root).

缺失模块。
1、请确保node版本大于6.2
2、在博客根目录（注意不是yilia根目录）执行以下命令：
npm i hexo-generator-json-content --save

3、在根目录_config.yml里添加配置：

  jsonContent:
    meta: false
    pages: false
    posts:
      title: true
      date: true
      path: true
      text: false
      raw: false
      content: false
      slug: false
      updated: false
      comments: false
      link: false
      permalink: false
      excerpt: false
      categories: false
      tags: true