OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
    • Binary Search Tree
    • Divide & Concquer
    • Path-recorder Depth-first Search
      • Binary Tree Paths
      • 863. All Nodes Distance K in Binary Tree
      • 606. Construct String from Binary Tree
      • 1367. Linked List in Binary Tree
      • 1343. Maximum Product of Splitted Binary Tree
      • 1457. Pseudo-Palindromic Paths in a Binary Tree
    • Order Traversal
    • 919. Complete Binary Tree Inserter
    • 1519. Number of Nodes in the Sub-Tree With the Same Label
    • 307. Range Sum Query - Mutable
    • 428. Serialize and Deserialize N-ary Tree
    • 315. Count of Smaller Numbers After Self
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Binary Tree & Divide Conquer

Path-recorder Depth-first Search

Binary Tree Paths863. All Nodes Distance K in Binary Tree606. Construct String from Binary Tree1367. Linked List in Binary Tree1343. Maximum Product of Splitted Binary Tree1457. Pseudo-Palindromic Paths in a Binary Tree
PreviousSum of Distances in TreeNextBinary Tree Paths

Last updated 6 years ago

Was this helpful?