My Practice
search
Ctrlk
  • Introduction
  • Chapter 1 Combination and Permutationchevron-right
  • Chapter 2 Binary Search & Sorted Arraychevron-right
  • Chapter 3 Binary Treechevron-right
    • Basicschevron-right
    • Traversalschevron-right
      • Problem 144: Binary Tree Preorder Traversal
      • Problem 94: Binary Tree Inorder Traversalchevron-right
      • Problem 145: Binary Tree Postorder Traversal
      • Problem 102: Binary Tree Level Order Traversalchevron-right
      • Problem 314: Binary Tree Vertical Order Traversal
      • Problem 105: Construct Binary Tree from Preorder and Inorder Traversal
      • Problem 106: Construct Binary Tree from Inorder and Postorder Traversal
      • Problem: Construct BST from given preorder traversal
      • Problem 285: Inorder Successor in BST
      • Problem 255: Verify Preorder Sequence in Binary Search Tree
    • Ancestorschevron-right
    • Serialize and Deserializechevron-right
    • LinkedList 与 Binary Tree 相互转换chevron-right
    • Problem: Insert Node in a Binary Search Tree (LintCode)
    • Problem: Search Range in Binary Search Tree (LintCode)
    • Problem 257: Binary Tree Paths
    • Problem 124: Binary Tree Maximum Path Sum
    • Problem 129: Sum Root to Leaf Numbers
    • Problem 173: Binary Search Tree Iterator
    • Problem 298: Binary Tree Longest Consecutive Sequence
    • Problem 199: Binary Tree Right Side View
    • Problem 250: Count Univalue Subtrees
    • Problem 96: Unique Binary Search Trees
    • Problem 95: Unique Binary Search Trees II
    • Problem 156: Binary Tree Upside Down
    • Problem 366: Find Leaves of Binary Tree
    • Problem 404: Sum of Left Leaves
    • Problem 270: Closest Binary Search Tree Valuechevron-right
    • Problem 333: Largest BST Subtree
    • Problem 315: Count of Smaller Numbers After Self
  • Chapter 4 DFS & BFSchevron-right
  • Chapter 5 Linked Listchevron-right
  • Chapter 6 Dynamic Programmingchevron-right
  • Chapter 7 Graph & Search
  • Chapter 8 Data Structurechevron-right
  • Chapter 9 High Frequencychevron-right
  • Post Chapter 1 Stringchevron-right
  • Post Chapter 2 Mathchevron-right
  • Post Chapter 3 Arraychevron-right
  • Facebookchevron-right
  • Amazonchevron-right
  • All Chapters Summarychevron-right
  • Core Java Interview Questionschevron-right
  • Basics of Sortingchevron-right
  • Behavior Questionschevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Chapter 3 Binary Tree

Traversals

Problem 144: Binary Tree Preorder Traversalchevron-rightProblem 94: Binary Tree Inorder Traversalchevron-rightProblem 145: Binary Tree Postorder Traversalchevron-rightProblem 102: Binary Tree Level Order Traversalchevron-rightProblem 314: Binary Tree Vertical Order Traversalchevron-rightProblem 105: Construct Binary Tree from Preorder and Inorder Traversalchevron-rightProblem 106: Construct Binary Tree from Inorder and Postorder Traversalchevron-rightProblem: Construct BST from given preorder traversalchevron-rightProblem 285: Inorder Successor in BSTchevron-rightProblem 255: Verify Preorder Sequence in Binary Search Treechevron-right
PreviousProblem 450: Delete Node in a BSTchevron-leftNextProblem 144: Binary Tree Preorder Traversalchevron-right

Last updated 6 years ago

Was this helpful?

Was this helpful?