Binary Tree

Table of Content

• All Traversal
  • Depth First Search
  • Breadth First Search / Level Order
  • Vertical Order
• Level, Height, Depth
  • Depth
  • Height
  • Level
  • Categorize
• Path
  • Path
  • Math in it: Bitwise, Divmod
  • Simple Path Tracking
• Side Views, Two Trees
  • Side Views
  • Two Trees
• Recursion with Return
  • Recursion with Return
• Manipulate Tree
  • Create a new tree

---

Print Values of Nodes

Python

nprint = lambda *l: print(", ".join(str(i.val if i else "None") for i in l))
# Usage Examples
nprint(node)
nprint(node1, node2, ...)