Skip to content

Unit 8 Session 1

Jump to bottom
Sar Champagne Bielert edited this page May 8, 2024 · 3 revisions

Part of TIP101 Unit 8

🔗 Problem Statements

Problem Set Version 1

  1. Build A Binary Tree I
  2. 3-Node Sum I
  3. 3-Node Sum II
  4. Find Leftmost Node I
  5. Find Leftmost Node II
  6. In-order Traversal
  7. Binary Tree Size
  8. Binary Tree Find
  9. BST Find
  10. BST Descending Leaves

Problem Set Version 2

  1. Build A Binary Tree II
  2. 3-Node Product I
  3. 3-Node Product II
  4. Find Rightmost Node I
  5. Find Rightmost Node II
  6. Post-order Traversal
  7. Binary Tree Product
  8. Binary Tree Is Leaf
  9. BST Is Leaf
  10. BST Is Full

Problem Set Version 3

  1. Build A Binary Tree III
  2. 3-Node Booleans
  3. 3-Node Equality
  4. Find Leftmost Path I
  5. Find Leftmost Path II
  6. Pre-order Traversal
  7. Binary Tree All Lesser
  8. Binary Tree Any Greater
  9. BST Any Greater
  10. BST Leaves Sum to Root
Clone this wiki locally