René's URL Explorer Experiment


Title: Tree LeetCode Problems | JavaScript Solutions

Open Graph Title: Tree LeetCode Problems | JavaScript Solutions

X Title: Tree LeetCode Problems | JavaScript Solutions

Description: Master Tree coding problems with 227 detailed JavaScript solutions to LeetCode tree problems.

Open Graph Description: Master Tree coding problems with 227 detailed JavaScript solutions to LeetCode tree problems.

X Description: Master Tree coding problems with 227 detailed JavaScript solutions to LeetCode tree problems.

Keywords:

Opengraph URL: https://leetcodejavascript.com/tags/tree

direct link

Domain: leetcodejavascript.com

Hey, it has json ld scripts: 
{"@context":"https://schema.org","@type":"WebPage","url":"https://leetcodejavascript.com/tags/tree","name":"Tree LeetCode Problems | JavaScript Solutions","description":"Master Tree coding problems with 227 detailed JavaScript solutions to LeetCode tree problems."}
authorLeetCodeJavascript.com
og:typewebsite
og:imagehttps://leetcodejavascript.com/og-image.jpg
og:site_nameLeetCode JavaScript Solutions
twitter:cardsummary_large_image
twitter:urlhttps://leetcodejavascript.com/tags/tree
twitter:imagehttps://leetcodejavascript.com/og-image.jpg
twitter:creator@joshcrozier
theme-color#1f2937

Links:

View Source Code on GitHubhttps://github.com/JoshCrozier/leetcode-javascript
All 2765 https://leetcodejavascript.com/
Array 1587 https://leetcodejavascript.com/tags/array
String 683 https://leetcodejavascript.com/tags/string
Hash Table 587 https://leetcodejavascript.com/tags/hash-table
Math 485 https://leetcodejavascript.com/tags/math
Dynamic Programming 458 https://leetcodejavascript.com/tags/dynamic-programming
Sorting 384 https://leetcodejavascript.com/tags/sorting
Greedy 348 https://leetcodejavascript.com/tags/greedy
Depth-First Search 293 https://leetcodejavascript.com/tags/depth-first-search
Binary Search 241 https://leetcodejavascript.com/tags/binary-search
Tree 227 https://leetcodejavascript.com/tags/tree
Breadth-First Search 224 https://leetcodejavascript.com/tags/breadth-first-search
Matrix 223 https://leetcodejavascript.com/tags/matrix
Two Pointers 200 https://leetcodejavascript.com/tags/two-pointers
Bit Manipulation 197 https://leetcodejavascript.com/tags/bit-manipulation
Binary Tree 175 https://leetcodejavascript.com/tags/binary-tree
Prefix Sum 159 https://leetcodejavascript.com/tags/prefix-sum
Stack 154 https://leetcodejavascript.com/tags/stack
Heap Priority Queue 152 https://leetcodejavascript.com/tags/heap-priority-queue
Simulation 150 https://leetcodejavascript.com/tags/simulation
Counting 134 https://leetcodejavascript.com/tags/counting
Graph 133 https://leetcodejavascript.com/tags/graph
Design 123 https://leetcodejavascript.com/tags/design
Sliding Window 112 https://leetcodejavascript.com/tags/sliding-window
Backtracking 104 https://leetcodejavascript.com/tags/backtracking
Union Find 79 https://leetcodejavascript.com/tags/union-find
Enumeration 78 https://leetcodejavascript.com/tags/enumeration
Linked List 78 https://leetcodejavascript.com/tags/linked-list
Ordered Set 60 https://leetcodejavascript.com/tags/ordered-set
Monotonic Stack 55 https://leetcodejavascript.com/tags/monotonic-stack
Trie 51 https://leetcodejavascript.com/tags/trie
Number Theory 47 https://leetcodejavascript.com/tags/number-theory
Divide and Conquer 46 https://leetcodejavascript.com/tags/divide-and-conquer
Recursion 45 https://leetcodejavascript.com/tags/recursion
Bitmask 41 https://leetcodejavascript.com/tags/bitmask
Queue 41 https://leetcodejavascript.com/tags/queue
Binary Search Tree 40 https://leetcodejavascript.com/tags/binary-search-tree
Segment Tree 38 https://leetcodejavascript.com/tags/segment-tree
Memoization 36 https://leetcodejavascript.com/tags/memoization
Geometry 36 https://leetcodejavascript.com/tags/geometry
Combinatorics 35 https://leetcodejavascript.com/tags/combinatorics
Topological Sort 33 https://leetcodejavascript.com/tags/topological-sort
Hash Function 30 https://leetcodejavascript.com/tags/hash-function
Binary Indexed Tree 28 https://leetcodejavascript.com/tags/binary-indexed-tree
Game Theory 26 https://leetcodejavascript.com/tags/game-theory
String Matching 23 https://leetcodejavascript.com/tags/string-matching
Shortest Path 23 https://leetcodejavascript.com/tags/shortest-path
Interactive 23 https://leetcodejavascript.com/tags/interactive
Rolling Hash 22 https://leetcodejavascript.com/tags/rolling-hash
Data Stream 20 https://leetcodejavascript.com/tags/data-stream
Brainteaser 16 https://leetcodejavascript.com/tags/brainteaser
Monotonic Queue 14 https://leetcodejavascript.com/tags/monotonic-queue
Randomized 12 https://leetcodejavascript.com/tags/randomized
Merge Sort 12 https://leetcodejavascript.com/tags/merge-sort
Doubly-Linked List 11 https://leetcodejavascript.com/tags/doubly-linked-list
Counting Sort 10 https://leetcodejavascript.com/tags/counting-sort
Iterator 9 https://leetcodejavascript.com/tags/iterator
Probability and Statistics 7 https://leetcodejavascript.com/tags/probability-and-statistics
Quickselect 7 https://leetcodejavascript.com/tags/quickselect
Suffix Array 6 https://leetcodejavascript.com/tags/suffix-array
Bucket Sort 6 https://leetcodejavascript.com/tags/bucket-sort
Line Sweep 5 https://leetcodejavascript.com/tags/line-sweep
Minimum Spanning Tree 5 https://leetcodejavascript.com/tags/minimum-spanning-tree
Reservoir Sampling 4 https://leetcodejavascript.com/tags/reservoir-sampling
Strongly Connected Component 3 https://leetcodejavascript.com/tags/strongly-connected-component
Eulerian Circuit 3 https://leetcodejavascript.com/tags/eulerian-circuit
Radix Sort 3 https://leetcodejavascript.com/tags/radix-sort
Rejection Sampling 2 https://leetcodejavascript.com/tags/rejection-sampling
Biconnected Component 1https://leetcodejavascript.com/tags/biconnected-component
View all solutions →https://leetcodejavascript.com/
Binary Tree Inorder Traversal#94 Easy https://leetcodejavascript.com/solutions/binary-tree-inorder-traversal
Unique Binary Search Trees II#95 Medium https://leetcodejavascript.com/solutions/unique-binary-search-trees-ii
Unique Binary Search Trees#96 Medium https://leetcodejavascript.com/solutions/unique-binary-search-trees
Validate Binary Search Tree#98 Medium https://leetcodejavascript.com/solutions/validate-binary-search-tree
Recover Binary Search Tree#99 Medium https://leetcodejavascript.com/solutions/recover-binary-search-tree
Same Tree#100 Easy https://leetcodejavascript.com/solutions/same-tree
Symmetric Tree#101 Easy https://leetcodejavascript.com/solutions/symmetric-tree
Binary Tree Level Order Traversal#102 Medium https://leetcodejavascript.com/solutions/binary-tree-level-order-traversal
Binary Tree Zigzag Level Order Traversal#103 Medium https://leetcodejavascript.com/solutions/binary-tree-zigzag-level-order-traversal
Maximum Depth of Binary Tree#104 Easy https://leetcodejavascript.com/solutions/maximum-depth-of-binary-tree
Construct Binary Tree from Preorder and Inorder Traversal#105 Medium https://leetcodejavascript.com/solutions/construct-binary-tree-from-preorder-and-inorder-traversal
Construct Binary Tree from Inorder and Postorder Traversal#106 Medium https://leetcodejavascript.com/solutions/construct-binary-tree-from-inorder-and-postorder-traversal
Binary Tree Level Order Traversal II#107 Medium https://leetcodejavascript.com/solutions/binary-tree-level-order-traversal-ii
Convert Sorted Array to Binary Search Tree#108 Easy https://leetcodejavascript.com/solutions/convert-sorted-array-to-binary-search-tree
Convert Sorted List to Binary Search Tree#109 Medium https://leetcodejavascript.com/solutions/convert-sorted-list-to-binary-search-tree
Balanced Binary Tree#110 Easy https://leetcodejavascript.com/solutions/balanced-binary-tree
Minimum Depth of Binary Tree#111 Easy https://leetcodejavascript.com/solutions/minimum-depth-of-binary-tree
Path Sum#112 Easy https://leetcodejavascript.com/solutions/path-sum
Path Sum II#113 Medium https://leetcodejavascript.com/solutions/path-sum-ii
Flatten Binary Tree to Linked List#114 Medium https://leetcodejavascript.com/solutions/flatten-binary-tree-to-linked-list
Populating Next Right Pointers in Each Node#116 Medium https://leetcodejavascript.com/solutions/populating-next-right-pointers-in-each-node
Populating Next Right Pointers in Each Node II#117 Medium https://leetcodejavascript.com/solutions/populating-next-right-pointers-in-each-node-ii
Binary Tree Maximum Path Sum#124 Hard https://leetcodejavascript.com/solutions/binary-tree-maximum-path-sum
Sum Root to Leaf Numbers#129 Medium https://leetcodejavascript.com/solutions/sum-root-to-leaf-numbers
Binary Tree Preorder Traversal#144 Easy https://leetcodejavascript.com/solutions/binary-tree-preorder-traversal
Binary Tree Postorder Traversal#145 Easy https://leetcodejavascript.com/solutions/binary-tree-postorder-traversal
Binary Tree Upside Down#156 Medium https://leetcodejavascript.com/solutions/binary-tree-upside-down
Binary Search Tree Iterator#173 Medium https://leetcodejavascript.com/solutions/binary-search-tree-iterator
Binary Tree Right Side View#199 Medium https://leetcodejavascript.com/solutions/binary-tree-right-side-view
Count Complete Tree Nodes#222 Easy https://leetcodejavascript.com/solutions/count-complete-tree-nodes
Invert Binary Tree#226 Easy https://leetcodejavascript.com/solutions/invert-binary-tree
Kth Smallest Element in a BST#230 Medium https://leetcodejavascript.com/solutions/kth-smallest-element-in-a-bst
Lowest Common Ancestor of a Binary Search Tree#235 Easy https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-a-binary-search-tree
Lowest Common Ancestor of a Binary Tree#236 Medium https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-a-binary-tree
Count Univalue Subtrees#250 Medium https://leetcodejavascript.com/solutions/count-univalue-subtrees
Verify Preorder Sequence in Binary Search Tree#255 Medium https://leetcodejavascript.com/solutions/verify-preorder-sequence-in-binary-search-tree
Binary Tree Paths#257 Easy https://leetcodejavascript.com/solutions/binary-tree-paths
Closest Binary Search Tree Value#270 Easy https://leetcodejavascript.com/solutions/closest-binary-search-tree-value
Closest Binary Search Tree Value II#272 Hard https://leetcodejavascript.com/solutions/closest-binary-search-tree-value-ii
Inorder Successor in BST#285 Medium https://leetcodejavascript.com/solutions/inorder-successor-in-bst
Serialize and Deserialize Binary Tree#297 Hard https://leetcodejavascript.com/solutions/serialize-and-deserialize-binary-tree
Binary Tree Longest Consecutive Sequence#298 Medium https://leetcodejavascript.com/solutions/binary-tree-longest-consecutive-sequence
Binary Tree Vertical Order Traversal#314 Medium https://leetcodejavascript.com/solutions/binary-tree-vertical-order-traversal
Verify Preorder Serialization of a Binary Tree#331 Medium https://leetcodejavascript.com/solutions/verify-preorder-serialization-of-a-binary-tree
Largest BST Subtree#333 Medium https://leetcodejavascript.com/solutions/largest-bst-subtree
House Robber III#337 Medium https://leetcodejavascript.com/solutions/house-robber-iii
Flatten Nested List Iterator#341 Medium https://leetcodejavascript.com/solutions/flatten-nested-list-iterator
Find Leaves of Binary Tree#366 Medium https://leetcodejavascript.com/solutions/find-leaves-of-binary-tree
Sum of Left Leaves#404 Easy https://leetcodejavascript.com/solutions/sum-of-left-leaves
Convert Binary Search Tree to Sorted Doubly Linked List#426 Medium https://leetcodejavascript.com/solutions/convert-binary-search-tree-to-sorted-doubly-linked-list
Construct Quad Tree#427 Medium https://leetcodejavascript.com/solutions/construct-quad-tree
Serialize and Deserialize N-ary Tree#428 Hard https://leetcodejavascript.com/solutions/serialize-and-deserialize-n-ary-tree
N-ary Tree Level Order Traversal#429 Medium https://leetcodejavascript.com/solutions/n-ary-tree-level-order-traversal
Encode N-ary Tree to Binary Tree#431 Hard https://leetcodejavascript.com/solutions/encode-n-ary-tree-to-binary-tree
Path Sum III#437 Medium https://leetcodejavascript.com/solutions/path-sum-iii
Serialize and Deserialize BST#449 Medium https://leetcodejavascript.com/solutions/serialize-and-deserialize-bst
Delete Node in a BST#450 Medium https://leetcodejavascript.com/solutions/delete-node-in-a-bst
Find Mode in Binary Search Tree#501 Easy https://leetcodejavascript.com/solutions/find-mode-in-binary-search-tree
Most Frequent Subtree Sum#508 Medium https://leetcodejavascript.com/solutions/most-frequent-subtree-sum
Inorder Successor in BST II#510 Medium https://leetcodejavascript.com/solutions/inorder-successor-in-bst-ii
Find Bottom Left Tree Value#513 Medium https://leetcodejavascript.com/solutions/find-bottom-left-tree-value
Find Largest Value in Each Tree Row#515 Medium https://leetcodejavascript.com/solutions/find-largest-value-in-each-tree-row
Minimum Absolute Difference in BST#530 Easy https://leetcodejavascript.com/solutions/minimum-absolute-difference-in-bst
Construct Binary Tree from String#536 Medium https://leetcodejavascript.com/solutions/construct-binary-tree-from-string
Convert BST to Greater Tree#538 Medium https://leetcodejavascript.com/solutions/convert-bst-to-greater-tree
Diameter of Binary Tree#543 Easy https://leetcodejavascript.com/solutions/diameter-of-binary-tree
Boundary of Binary Tree#545 Medium https://leetcodejavascript.com/solutions/boundary-of-binary-tree
Binary Tree Longest Consecutive Sequence II#549 Medium https://leetcodejavascript.com/solutions/binary-tree-longest-consecutive-sequence-ii
Logical OR of Two Binary Grids Represented as Quad-Trees#558 Medium https://leetcodejavascript.com/solutions/logical-or-of-two-binary-grids-represented-as-quad-trees
Maximum Depth of N-ary Tree#559 Easy https://leetcodejavascript.com/solutions/maximum-depth-of-n-ary-tree
Binary Tree Tilt#563 Easy https://leetcodejavascript.com/solutions/binary-tree-tilt
Subtree of Another Tree#572 Easy https://leetcodejavascript.com/solutions/subtree-of-another-tree
Kill Process#582 Medium https://leetcodejavascript.com/solutions/kill-process
N-ary Tree Preorder Traversal#589 Easy https://leetcodejavascript.com/solutions/n-ary-tree-preorder-traversal
N-ary Tree Postorder Traversal#590 Easy https://leetcodejavascript.com/solutions/n-ary-tree-postorder-traversal
Construct String from Binary Tree#606 Easy https://leetcodejavascript.com/solutions/construct-string-from-binary-tree
Merge Two Binary Trees#617 Easy https://leetcodejavascript.com/solutions/merge-two-binary-trees
Add One Row to Tree#623 Medium https://leetcodejavascript.com/solutions/add-one-row-to-tree
Average of Levels in Binary Tree#637 Easy https://leetcodejavascript.com/solutions/average-of-levels-in-binary-tree
Find Duplicate Subtrees#652 Medium https://leetcodejavascript.com/solutions/find-duplicate-subtrees
Two Sum IV - Input is a BST#653 Easy https://leetcodejavascript.com/solutions/two-sum-iv-input-is-a-bst
Maximum Binary Tree#654 Medium https://leetcodejavascript.com/solutions/maximum-binary-tree
Print Binary Tree#655 Medium https://leetcodejavascript.com/solutions/print-binary-tree
Maximum Width of Binary Tree#662 Medium https://leetcodejavascript.com/solutions/maximum-width-of-binary-tree
Equal Tree Partition#663 Medium https://leetcodejavascript.com/solutions/equal-tree-partition
Path Sum IV#666 Medium https://leetcodejavascript.com/solutions/path-sum-iv
Trim a Binary Search Tree#669 Medium https://leetcodejavascript.com/solutions/trim-a-binary-search-tree
Second Minimum Node In a Binary Tree#671 Easy https://leetcodejavascript.com/solutions/second-minimum-node-in-a-binary-tree
Longest Univalue Path#687 Medium https://leetcodejavascript.com/solutions/longest-univalue-path
Employee Importance#690 Medium https://leetcodejavascript.com/solutions/employee-importance
Search in a Binary Search Tree#700 Easy https://leetcodejavascript.com/solutions/search-in-a-binary-search-tree
Insert into a Binary Search Tree#701 Medium https://leetcodejavascript.com/solutions/insert-into-a-binary-search-tree
Kth Largest Element in a Stream#703 Easy https://leetcodejavascript.com/solutions/kth-largest-element-in-a-stream
Closest Leaf in a Binary Tree#742 Medium https://leetcodejavascript.com/solutions/closest-leaf-in-a-binary-tree
Split BST#776 Medium https://leetcodejavascript.com/solutions/split-bst
Minimum Distance Between BST Nodes#783 Easy https://leetcodejavascript.com/solutions/minimum-distance-between-bst-nodes
Binary Tree Pruning#814 Medium https://leetcodejavascript.com/solutions/binary-tree-pruning
Sum of Distances in Tree#834 Hard https://leetcodejavascript.com/solutions/sum-of-distances-in-tree
All Nodes Distance K in Binary Tree#863 Medium https://leetcodejavascript.com/solutions/all-nodes-distance-k-in-binary-tree
Smallest Subtree with all the Deepest Nodes#865 Medium https://leetcodejavascript.com/solutions/smallest-subtree-with-all-the-deepest-nodes
Leaf-Similar Trees#872 Easy https://leetcodejavascript.com/solutions/leaf-similar-trees
Construct Binary Tree from Preorder and Postorder Traversal#889 Medium https://leetcodejavascript.com/solutions/construct-binary-tree-from-preorder-and-postorder-traversal
All Possible Full Binary Trees#894 Medium https://leetcodejavascript.com/solutions/all-possible-full-binary-trees
Increasing Order Search Tree#897 Easy https://leetcodejavascript.com/solutions/increasing-order-search-tree
Complete Binary Tree Inserter#919 Medium https://leetcodejavascript.com/solutions/complete-binary-tree-inserter
Range Sum of BST#938 Easy https://leetcodejavascript.com/solutions/range-sum-of-bst
Flip Equivalent Binary Trees#951 Medium https://leetcodejavascript.com/solutions/flip-equivalent-binary-trees
Check Completeness of a Binary Tree#958 Medium https://leetcodejavascript.com/solutions/check-completeness-of-a-binary-tree
Univalued Binary Tree#965 Easy https://leetcodejavascript.com/solutions/univalued-binary-tree
Binary Tree Cameras#968 Hard https://leetcodejavascript.com/solutions/binary-tree-cameras
Flip Binary Tree To Match Preorder Traversal#971 Medium https://leetcodejavascript.com/solutions/flip-binary-tree-to-match-preorder-traversal
Distribute Coins in Binary Tree#979 Medium https://leetcodejavascript.com/solutions/distribute-coins-in-binary-tree
Vertical Order Traversal of a Binary Tree#987 Hard https://leetcodejavascript.com/solutions/vertical-order-traversal-of-a-binary-tree
Smallest String Starting From Leaf#988 Medium https://leetcodejavascript.com/solutions/smallest-string-starting-from-leaf
Cousins in Binary Tree#993 Easy https://leetcodejavascript.com/solutions/cousins-in-binary-tree
Maximum Binary Tree II#998 Medium https://leetcodejavascript.com/solutions/maximum-binary-tree-ii
Construct Binary Search Tree from Preorder Traversal#1008 Medium https://leetcodejavascript.com/solutions/construct-binary-search-tree-from-preorder-traversal
Sum of Root To Leaf Binary Numbers#1022 Easy https://leetcodejavascript.com/solutions/sum-of-root-to-leaf-binary-numbers
Maximum Difference Between Node and Ancestor#1026 Medium https://leetcodejavascript.com/solutions/maximum-difference-between-node-and-ancestor
Recover a Tree From Preorder Traversal#1028 Hard https://leetcodejavascript.com/solutions/recover-a-tree-from-preorder-traversal
Binary Search Tree to Greater Sum Tree#1038 Medium https://leetcodejavascript.com/solutions/binary-search-tree-to-greater-sum-tree
Insufficient Nodes in Root to Leaf Paths#1080 Medium https://leetcodejavascript.com/solutions/insufficient-nodes-in-root-to-leaf-paths
Path In Zigzag Labelled Binary Tree#1104 Medium https://leetcodejavascript.com/solutions/path-in-zigzag-labelled-binary-tree
Delete Nodes And Return Forest#1110 Medium https://leetcodejavascript.com/solutions/delete-nodes-and-return-forest
Maximum Average Subtree#1120 Medium https://leetcodejavascript.com/solutions/maximum-average-subtree
Lowest Common Ancestor of Deepest Leaves#1123 Medium https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-deepest-leaves
Binary Tree Coloring Game#1145 Medium https://leetcodejavascript.com/solutions/binary-tree-coloring-game
Maximum Level Sum of a Binary Tree#1161 Medium https://leetcodejavascript.com/solutions/maximum-level-sum-of-a-binary-tree
Two Sum BSTs#1214 Medium https://leetcodejavascript.com/solutions/two-sum-bsts
Tree Diameter#1245 Medium https://leetcodejavascript.com/solutions/tree-diameter
Smallest Common Region#1257 Medium https://leetcodejavascript.com/solutions/smallest-common-region
Find Elements in a Contaminated Binary Tree#1261 Medium https://leetcodejavascript.com/solutions/find-elements-in-a-contaminated-binary-tree
Delete Tree Nodes#1273 Medium https://leetcodejavascript.com/solutions/delete-tree-nodes
Deepest Leaves Sum#1302 Medium https://leetcodejavascript.com/solutions/deepest-leaves-sum
All Elements in Two Binary Search Trees#1305 Medium https://leetcodejavascript.com/solutions/all-elements-in-two-binary-search-trees
Sum of Nodes with Even-Valued Grandparent#1315 Medium https://leetcodejavascript.com/solutions/sum-of-nodes-with-even-valued-grandparent
Delete Leaves With a Given Value#1325 Medium https://leetcodejavascript.com/solutions/delete-leaves-with-a-given-value
Maximum Product of Splitted Binary Tree#1339 Medium https://leetcodejavascript.com/solutions/maximum-product-of-splitted-binary-tree
Validate Binary Tree Nodes#1361 Medium https://leetcodejavascript.com/solutions/validate-binary-tree-nodes
Linked List in Binary Tree#1367 Medium https://leetcodejavascript.com/solutions/linked-list-in-binary-tree
Longest ZigZag Path in a Binary Tree#1372 Medium https://leetcodejavascript.com/solutions/longest-zigzag-path-in-a-binary-tree
Maximum Sum BST in Binary Tree#1373 Hard https://leetcodejavascript.com/solutions/maximum-sum-bst-in-binary-tree
Time Needed to Inform All Employees#1376 Medium https://leetcodejavascript.com/solutions/time-needed-to-inform-all-employees
Frog Position After T Seconds#1377 Hard https://leetcodejavascript.com/solutions/frog-position-after-t-seconds
Find a Corresponding Node of a Binary Tree in a Clone of That Tree#1379 Easy https://leetcodejavascript.com/solutions/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
Balance a Binary Search Tree#1382 Medium https://leetcodejavascript.com/solutions/balance-a-binary-search-tree
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree#1430 Medium https://leetcodejavascript.com/solutions/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree
Minimum Time to Collect All Apples in a Tree#1443 Medium https://leetcodejavascript.com/solutions/minimum-time-to-collect-all-apples-in-a-tree
Count Good Nodes in Binary Tree#1448 Medium https://leetcodejavascript.com/solutions/count-good-nodes-in-binary-tree
Pseudo-Palindromic Paths in a Binary Tree#1457 Medium https://leetcodejavascript.com/solutions/pseudo-palindromic-paths-in-a-binary-tree
Find All The Lonely Nodes#1469 Easy https://leetcodejavascript.com/solutions/find-all-the-lonely-nodes
Kth Ancestor of a Tree Node#1483 Hard https://leetcodejavascript.com/solutions/kth-ancestor-of-a-tree-node
Clone Binary Tree With Random Pointer#1485 Medium https://leetcodejavascript.com/solutions/clone-binary-tree-with-random-pointer
Clone N-ary Tree#1490 Medium https://leetcodejavascript.com/solutions/clone-n-ary-tree
Find Root of N-Ary Tree#1506 Medium https://leetcodejavascript.com/solutions/find-root-of-n-ary-tree
Move Sub-Tree of N-Ary Tree#1516 Hard https://leetcodejavascript.com/solutions/move-sub-tree-of-n-ary-tree
Number of Nodes in the Sub-Tree With the Same Label#1519 Medium https://leetcodejavascript.com/solutions/number-of-nodes-in-the-sub-tree-with-the-same-label
Diameter of N-Ary Tree#1522 Medium https://leetcodejavascript.com/solutions/diameter-of-n-ary-tree
Number of Good Leaf Nodes Pairs#1530 Medium https://leetcodejavascript.com/solutions/number-of-good-leaf-nodes-pairs
Number of Ways to Reorder Array to Get Same BST#1569 Hard https://leetcodejavascript.com/solutions/number-of-ways-to-reorder-array-to-get-same-bst
Binary Search Tree Iterator II#1586 Medium https://leetcodejavascript.com/solutions/binary-search-tree-iterator-ii
Build Binary Expression Tree From Infix Expression#1597 Hard https://leetcodejavascript.com/solutions/build-binary-expression-tree-from-infix-expression
Throne Inheritance#1600 Medium https://leetcodejavascript.com/solutions/throne-inheritance
Find Nearest Right Node in Binary Tree#1602 Medium https://leetcodejavascript.com/solutions/find-nearest-right-node-in-binary-tree
Even Odd Tree#1609 Medium https://leetcodejavascript.com/solutions/even-odd-tree
Check If Two Expression Trees are Equivalent#1612 Medium https://leetcodejavascript.com/solutions/check-if-two-expression-trees-are-equivalent
Count Subtrees With Max Distance Between Cities#1617 Hard https://leetcodejavascript.com/solutions/count-subtrees-with-max-distance-between-cities
Design an Expression Tree With Evaluate Function#1628 Medium https://leetcodejavascript.com/solutions/design-an-expression-tree-with-evaluate-function
Lowest Common Ancestor of a Binary Tree II#1644 Medium https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-a-binary-tree-ii
Lowest Common Ancestor of a Binary Tree III#1650 Medium https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-a-binary-tree-iii
Correct a Binary Tree#1660 Medium https://leetcodejavascript.com/solutions/correct-a-binary-tree
Change the Root of a Binary Tree#1666 Medium https://leetcodejavascript.com/solutions/change-the-root-of-a-binary-tree
Lowest Common Ancestor of a Binary Tree IV#1676 Medium https://leetcodejavascript.com/solutions/lowest-common-ancestor-of-a-binary-tree-iv
Number Of Ways To Reconstruct A Tree#1719 Hard https://leetcodejavascript.com/solutions/number-of-ways-to-reconstruct-a-tree
Find Distance in a Binary Tree#1740 Medium https://leetcodejavascript.com/solutions/find-distance-in-a-binary-tree
Tree of Coprimes#1766 Hard https://leetcodejavascript.com/solutions/tree-of-coprimes
Depth of BST Given Insertion Order#1902 Medium https://leetcodejavascript.com/solutions/depth-of-bst-given-insertion-order
Count Ways to Build Rooms in an Ant Colony#1916 Hard https://leetcodejavascript.com/solutions/count-ways-to-build-rooms-in-an-ant-colony
Merge BSTs to Create Single BST#1932 Hard https://leetcodejavascript.com/solutions/merge-bsts-to-create-single-bst
Count Nodes Equal to Sum of Descendants#1973 Medium https://leetcodejavascript.com/solutions/count-nodes-equal-to-sum-of-descendants
Operations on Tree#1993 Medium https://leetcodejavascript.com/solutions/operations-on-tree
Smallest Missing Genetic Value in Each Subtree#2003 Hard https://leetcodejavascript.com/solutions/smallest-missing-genetic-value-in-each-subtree
Subtree Removal Game with Fibonacci Tree#2005 Hard https://leetcodejavascript.com/solutions/subtree-removal-game-with-fibonacci-tree
Count Nodes With the Highest Score#2049 Medium https://leetcodejavascript.com/solutions/count-nodes-with-the-highest-score
Step-By-Step Directions From a Binary Tree Node to Another#2096 Medium https://leetcodejavascript.com/solutions/step-by-step-directions-from-a-binary-tree-node-to-another
Create Binary Tree From Descriptions#2196 Medium https://leetcodejavascript.com/solutions/create-binary-tree-from-descriptions
Root Equals Sum of Children#2236 Easy https://leetcodejavascript.com/solutions/root-equals-sum-of-children
Longest Path With Different Adjacent Characters#2246 Hard https://leetcodejavascript.com/solutions/longest-path-with-different-adjacent-characters
Count Nodes Equal to Average of Subtree#2265 Medium https://leetcodejavascript.com/solutions/count-nodes-equal-to-average-of-subtree
Closest Node to Path in Tree#2277 Hard https://leetcodejavascript.com/solutions/closest-node-to-path-in-tree
Minimum Flips in Binary Tree to Get Result#2313 Hard https://leetcodejavascript.com/solutions/minimum-flips-in-binary-tree-to-get-result
Minimum Score After Removals on a Tree#2322 Hard https://leetcodejavascript.com/solutions/minimum-score-after-removals-on-a-tree
Evaluate Boolean Binary Tree#2331 Easy https://leetcodejavascript.com/solutions/evaluate-boolean-binary-tree
Reachable Nodes With Restrictions#2368 Medium https://leetcodejavascript.com/solutions/reachable-nodes-with-restrictions
Choose Edges to Maximize Score in a Tree#2378 Medium https://leetcodejavascript.com/solutions/choose-edges-to-maximize-score-in-a-tree
Amount of Time for Binary Tree to Be Infected#2385 Medium https://leetcodejavascript.com/solutions/amount-of-time-for-binary-tree-to-be-infected
Reverse Odd Levels of Binary Tree#2415 Medium https://leetcodejavascript.com/solutions/reverse-odd-levels-of-binary-tree
Number of Good Paths#2421 Hard https://leetcodejavascript.com/solutions/number-of-good-paths
Create Components With Same Value#2440 Hard https://leetcodejavascript.com/solutions/create-components-with-same-value
Number of Nodes With Value One#2445 Medium https://leetcodejavascript.com/solutions/number-of-nodes-with-value-one
Height of Binary Tree After Subtree Removal Queries#2458 Hard https://leetcodejavascript.com/solutions/height-of-binary-tree-after-subtree-removal-queries
Most Profitable Path in a Tree#2467 Medium https://leetcodejavascript.com/solutions/most-profitable-path-in-a-tree
Minimum Number of Operations to Sort a Binary Tree by Level#2471 Medium https://leetcodejavascript.com/solutions/minimum-number-of-operations-to-sort-a-binary-tree-by-level
Closest Nodes Queries in a Binary Search Tree#2476 Medium https://leetcodejavascript.com/solutions/closest-nodes-queries-in-a-binary-search-tree
Minimum Fuel Cost to Report to the Capital#2477 Medium https://leetcodejavascript.com/solutions/minimum-fuel-cost-to-report-to-the-capital
Maximum XOR of Two Non-Overlapping Subtrees#2479 Hard https://leetcodejavascript.com/solutions/maximum-xor-of-two-non-overlapping-subtrees
Cycle Length Queries in a Tree#2509 Hard https://leetcodejavascript.com/solutions/cycle-length-queries-in-a-tree
Count Number of Possible Root Nodes#2581 Hard https://leetcodejavascript.com/solutions/count-number-of-possible-root-nodes
Kth Largest Sum in a Binary Tree#2583 Medium https://leetcodejavascript.com/solutions/kth-largest-sum-in-a-binary-tree
Cousins in Binary Tree II#2641 Medium https://leetcodejavascript.com/solutions/cousins-in-binary-tree-ii
Minimize the Total Price of the Trips#2646 Hard https://leetcodejavascript.com/solutions/minimize-the-total-price-of-the-trips
Make Costs of Paths Equal in a Binary Tree#2673 Medium https://leetcodejavascript.com/solutions/make-costs-of-paths-equal-in-a-binary-tree
Extract Kth Character From The Rope Tree#2689 Easy https://leetcodejavascript.com/solutions/extract-kth-character-from-the-rope-tree
Is Array a Preorder of Some ‌Binary Tree#2764 Medium https://leetcodejavascript.com/solutions/is-array-a-preorder-of-some-binary-tree
Height of Special Binary Tree#2773 Medium https://leetcodejavascript.com/solutions/height-of-special-binary-tree
Count Paths That Can Form a Palindrome in a Tree#2791 Hard https://leetcodejavascript.com/solutions/count-paths-that-can-form-a-palindrome-in-a-tree
Count Nodes That Are Great Enough#2792 Hard https://leetcodejavascript.com/solutions/count-nodes-that-are-great-enough
Minimum Edge Weight Equilibrium Queries in a Tree#2846 Hard https://leetcodejavascript.com/solutions/minimum-edge-weight-equilibrium-queries-in-a-tree
Maximum Number of K-Divisible Components#2872 Hard https://leetcodejavascript.com/solutions/maximum-number-of-k-divisible-components
Maximum Score After Applying Operations on a Tree#2925 Medium https://leetcodejavascript.com/solutions/maximum-score-after-applying-operations-on-a-tree
Maximum Subtree of the Same Color#3004 Medium https://leetcodejavascript.com/solutions/maximum-subtree-of-the-same-color
Count Pairs of Connectable Servers in a Weighted Tree Network#3067 Medium https://leetcodejavascript.com/solutions/count-pairs-of-connectable-servers-in-a-weighted-tree-network
Find the Maximum Sum of Node Values#3068 Hard https://leetcodejavascript.com/solutions/find-the-maximum-sum-of-node-values
Find the Level of Tree with Minimum Sum#3157 Medium https://leetcodejavascript.com/solutions/find-the-level-of-tree-with-minimum-sum
Find the Last Marked Nodes in Tree#3313 Hard https://leetcodejavascript.com/solutions/find-the-last-marked-nodes-in-tree
Maximize the Number of Target Nodes After Connecting Trees I#3372 Medium https://leetcodejavascript.com/solutions/maximize-the-number-of-target-nodes-after-connecting-trees-i
Maximize the Number of Target Nodes After Connecting Trees II#3373 Hardhttps://leetcodejavascript.com/solutions/maximize-the-number-of-target-nodes-after-connecting-trees-ii
Josh Crozierhttps://joshcrozier.com

Viewport: width=device-width,initial-scale=1

Robots: index, follow

URLs of crawlers that visited me.