ThinkerQAQ

先序遍历

Data Structures & Algorithms · 10 notes

  1. Flatten Binary Tree to Linked Listhistorical

    LeetCode notes on flattening a binary tree into a linked list in preorder.

  2. Lowest Common Ancestor of a Binary Treehistorical

    LeetCode notes on finding the lowest common ancestor in a binary tree.

  3. Diameter of Binary Treehistorical

    LeetCode notes on calculating the diameter of a binary tree.

  4. Lowest Common Ancestor Nodehistorical

    Notes on finding the lowest common ancestor of two nodes in a binary tree.

  5. Merge Two Binary Treeshistorical

    LeetCode notes on merging two binary trees.

  6. Symmetric Treehistorical

    LeetCode notes on checking whether a binary tree is mirror-symmetric.

  7. House Robber IIIhistorical

    LeetCode notes on House Robber III using DFS and memoization.

  8. Sum Root to Leaf Numbershistorical

    LeetCode notes on summing all numbers formed by root-to-leaf paths.

  9. Invert Binary Treehistorical

    LeetCode notes on Invert Binary Tree.

  10. Path Sum IIIhistorical

    LeetCode notes on Path Sum III.