OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
    • Implement Queue by Two Stacks
    • 155. Min Stack
    • Implement Stack using Queues
    • 结合前面的输入
    • 维持递增或递减
    • Nested
    • Tree Traversal
      • Binary Tree Preorder Traversal
      • Path Sum II
      • Subtree of Another Tree
      • Binary Tree Inorder Traversal
      • Binary Tree Postorder Traversal
      • Binary Search Tree Iterator
      • Reconstruct Itinerary
      • Sum of Left Leaves
  • 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. Stack

Tree Traversal

Binary Tree Preorder TraversalPath Sum IISubtree of Another TreeBinary Tree Inorder TraversalBinary Tree Postorder TraversalBinary Search Tree IteratorReconstruct ItinerarySum of Left Leaves
Previous1096. Brace Expansion IINextBinary Tree Preorder Traversal

Last updated 6 years ago

Was this helpful?