fix: move #+PROPERTY: STUDY_DECK_02 to top of file

Org-mode requires global file properties before the first headline. Moved PROPERTY line above the * TODO heading in all 199 note files and updated scaffold-notes.mjs template.
2026-06-01 17:12:10 +08:00
parent d674451070
commit e798e449bd
200 changed files with 201 additions and 201 deletions
@@ -1,5 +1,5 @@
-* TODO 0098. Validate Binary Search Tree :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0098. Validate Binary Search Tree :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0098. Validate Binary Search Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0100. Same Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0100. Same Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0100. Same Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0102. Binary Tree Level Order Traversal :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0102. Binary Tree Level Order Traversal :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0102. Binary Tree Level Order Traversal][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0104. Maximum Depth of Binary Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0104. Maximum Depth of Binary Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0104. Maximum Depth of Binary Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0105. Construct Binary Tree From Preorder And Inorder Traversal :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0105. Construct Binary Tree From Preorder And Inorder Traversal][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0110. Balanced Binary Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0110. Balanced Binary Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0110. Balanced Binary Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0124. Binary Tree Maximum Path Sum :hard:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0124. Binary Tree Maximum Path Sum :hard:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0124. Binary Tree Maximum Path Sum][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0199. Binary Tree Right Side View :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0199. Binary Tree Right Side View :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0199. Binary Tree Right Side View][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0226. Invert Binary Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0226. Invert Binary Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0226. Invert Binary Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0230. Kth Smallest Element In a Bst :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0230. Kth Smallest Element In a Bst :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0230. Kth Smallest Element In a Bst][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0235. Lowest Common Ancestor of a Binary Search Tree :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0235. Lowest Common Ancestor of a Binary Search Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0297. Serialize And Deserialize Binary Tree :hard:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0297. Serialize And Deserialize Binary Tree :hard:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0297. Serialize And Deserialize Binary Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0543. Diameter of Binary Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0543. Diameter of Binary Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0543. Diameter of Binary Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0572. Subtree of Another Tree :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0572. Subtree of Another Tree :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0572. Subtree of Another Tree][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 0590. N-ary Tree Postorder Traversal :easy:
 #+PROPERTY: STUDY_DECK_02
+* TODO 0590. N-ary Tree Postorder Traversal :easy:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*0590. N-ary Tree Postorder Traversal][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 1028. Recover a Tree From Preorder Traversal :hard:
 #+PROPERTY: STUDY_DECK_02
+* TODO 1028. Recover a Tree From Preorder Traversal :hard:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*1028. Recover a Tree From Preorder Traversal][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 1376. Time Needed to Inform All Employees :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 1376. Time Needed to Inform All Employees :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*1376. Time Needed to Inform All Employees][Roadmap]]
 :END:
@@ -1,5 +1,5 @@
-* TODO 1448. Count Good Nodes In Binary Tree :medium:
 #+PROPERTY: STUDY_DECK_02
+* TODO 1448. Count Good Nodes In Binary Tree :medium:
 :PROPERTIES:
 :NEETCODE: [[file:../../roadmap.org::*1448. Count Good Nodes In Binary Tree][Roadmap]]
 :END: