_{[0110 - Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)} | _{<div align='center'>[✔️](c%2F0110-balanced-binary-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0110-balanced-binary-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0110-balanced-binary-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0110-balanced-binary-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0110-balanced-binary-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0110-balanced-binary-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0110-balanced-binary-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0110-balanced-binary-tree.py)</div>} | _{<div align='center'>[✔️](ruby%2F0110-balanced-binary-tree.rb)</div>} | _{<div align='center'>[✔️](rust%2F0110-balanced-binary-tree.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0110-balanced-binary-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0110-balanced-binary-tree.ts)</div>}

_{[0100 - Same Tree](https://leetcode.com/problems/same-tree/)} | _{<div align='center'>[✔️](c%2F0100-same-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0100-same-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0100-same-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0100-same-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0100-same-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0100-same-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0100-same-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0100-same-tree.py)</div>} | _{<div align='center'>[✔️](ruby%2F0100-same-tree.rb)</div>} | _{<div align='center'>[✔️](rust%2F0100-same-tree.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0100-same-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0100-same-tree.ts)</div>}

_{[0572 - Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)} | _{<div align='center'>[✔️](c%2F0572-subtree-of-another-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0572-subtree-of-another-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0572-subtree-of-another-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0572-subtree-of-another-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0572-subtree-of-another-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0572-subtree-of-another-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0572-subtree-of-another-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0572-subtree-of-another-tree.py)</div>} | _{<div align='center'>[✔️](ruby%2F0572-subtree-of-another-tree.rb)</div>} | _{<div align='center'>[✔️](rust%2F0572-subtree-of-another-tree.rs)</div>} | _{<div align='center'>[✔️](scala%2F0572-subtree-of-another-tree.scala)</div>} | _{<div align='center'>[✔️](swift%2F0572-subtree-of-another-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0572-subtree-of-another-tree.ts)</div>}

_{[0108 - Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)} | _{<div align='center'>[✔️](c%2F0108-convert-sorted-array-to-binary-search-tree.c)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0108-convert-sorted-array-to-binary-search-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0108-convert-sorted-array-to-binary-search-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0108-convert-sorted-array-to-binary-search-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0108-convert-sorted-array-to-binary-search-tree.kt)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[0108 - Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)} | _{<div align='center'>[✔️](c%2F0108-convert-sorted-array-to-binary-search-tree.c)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0108-convert-sorted-array-to-binary-search-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0108-convert-sorted-array-to-binary-search-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0108-convert-sorted-array-to-binary-search-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0108-convert-sorted-array-to-binary-search-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0108-convert-sorted-array-to-binary-search-tree.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[0617 - Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)} | _{<div align='center'>[✔️](c%2F0617-merge-two-binary-trees.c)</div>} | _{<div align='center'>[✔️](cpp%2F0617-merge-two-binary-trees.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](dart%2F0617-merge-two-binary-trees.dart)</div>} | _{<div align='center'>[✔️](go%2F0617-merge-two-binary-trees.go)</div>} | _{<div align='center'>[✔️](java%2F0617-merge-two-binary-trees.java)</div>} | _{<div align='center'>[✔️](javascript%2F0617-merge-two-binary-trees.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0617-merge-two-binary-trees.kt)</div>} | _{<div align='center'>[✔️](python%2F0617-merge-two-binary-trees.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[0112 - Path Sum](https://leetcode.com/problems/path-sum/)} | _{<divalign='center'>[✔️](c%2F0112-path-sum.c)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](csharp%2F0112-path-sum.cs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0112-path-sum.go)</div>} | _{<divalign='center'>[✔️](java%2F0112-path-sum.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0112-path-sum.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0112-path-sum.kt)</div>} | _{<divalign='center'>[✔️](python%2F0112-path-sum.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](swift%2F0112-path-sum.swift)</div>} | _{<divalign='center'>❌</div>}

_{[0606 - Construct String From Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0606-construct-string-from-binary-tree.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0606-construct-string-from-binary-tree.kt)</div>} | _{<divalign='center'>[✔️](python%2F0606-construct-string-from-binary-tree.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0783 - Minimum Distance between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0783-minimum-distance-between-bst-nodes.kt)</div>} | _{<divalign='center'>[✔️](python%2F0783-minimum-distance-between-bst-nodes.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0101 - Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0101-symmetric-tree.kt)</div>} | _{<divalign='center'>[✔️](python%2F0101-symmetric-tree.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1443 - Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](rust%2F1443-minimum-time-to-collect-all-apples-in-a-tree.rs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0103 - Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0103-binary-tree-zigzag-level-order-traversal.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0103-binary-tree-zigzag-level-order-traversal.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0103 - Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0103-binary-tree-zigzag-level-order-traversal.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0103-binary-tree-zigzag-level-order-traversal.kt)</div>} | _{<divalign='center'>[✔️](python%2F0103-binary-tree-zigzag-level-order-traversal.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0427 - Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0427-construct-quad-tree.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0652 - Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0652-find-duplicate-subtrees.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0958 - Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0958-check-completeness-of-a-binary-tree.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0958-check-completeness-of-a-binary-tree.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}