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
    • Order Traversal
      • Serialize and Deserialize Binary Tree
      • 958. Check Completeness of a Binary Tree
      • 742. Closest Leaf in a Binary Tree
      • Find Duplicate Subtrees
    • 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

Order Traversal

Serialize and Deserialize Binary Tree958. Check Completeness of a Binary Tree742. Closest Leaf in a Binary TreeFind Duplicate Subtrees
Previous1457. Pseudo-Palindromic Paths in a Binary TreeNextSerialize and Deserialize Binary Tree

Last updated 6 years ago

Was this helpful?