OJ
search
⌘Ctrlk
OJ
  • 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
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Stack

Tree Traversal

Binary Tree Preorder Traversalchevron-rightPath Sum IIchevron-rightSubtree of Another Treechevron-rightBinary Tree Inorder Traversalchevron-rightBinary Tree Postorder Traversalchevron-rightBinary Search Tree Iteratorchevron-rightReconstruct Itinerarychevron-rightSum of Left Leaveschevron-right
Previous1096. Brace Expansion IIchevron-leftNextBinary Tree Preorder Traversalchevron-right

Last updated 6 years ago