📘
algorithmStudy
Ctrlk
  • Algorithm and Data Structure
  • Data structures
  • Binary Search
  • Linked List
  • String
  • Array
  • BFS
  • Tree
    • V. Reconstruct Binary Tree
    • IV. Lowest Common Ancestor
    • III. Maximum Path Sum
    • II. Tree Traversal
    • I. Basic Tree Problems
      • 1.7 Store number of nodes in left subtree
      • 1.6 Reverse binary tree upside down
      • 1.5 Binary Search Tree or not
      • 1.4 Tweaked Identical Binary Trees
      • 1.3 Symmetric Binary Tree
      • 1.2 Check if a binary tree is complete
      • 1.1 Check if a Binary Tree is balanced
  • DFS
  • DP
Powered by GitBook
On this page

Was this helpful?

  1. Tree

I. Basic Tree Problems

1.7 Store number of nodes in left subtree1.6 Reverse binary tree upside down1.5 Binary Search Tree or not1.4 Tweaked Identical Binary Trees1.3 Symmetric Binary Tree1.2 Check if a binary tree is complete1.1 Check if a Binary Tree is balanced
Previous2.1 Search in BSTNext1.7 Store number of nodes in left subtree

Last updated 4 years ago

Was this helpful?