_{[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>}

_{[0106 - Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0106 - Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.kt)</div>} | _{<divalign='center'>[✔️](python%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0662 - Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0662-maximum-width-of-binary-tree.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0662-maximum-width-of-binary-tree.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1376 - Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F1376-time-needed-to-inform-all-employees.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1448 - Count Good Nodes In Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)} | _{<div align='center'>[✔️](c%2F1448-Count-Good-Nodes-in-Binary-Tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F1448-Count-Good-Nodes-In-Binary-Tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F1448-Count-Good-Nodes-in-Binary-Tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F1448-count-good-nodes-in-binary-tree.go)</div>} | _{<div align='center'>[✔️](java%2F1448-Count-Good-Nodes-in-Binary-Tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F1448-Count-Good-Nodes-in-Binary-Tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F1448-Count-Good-Nodes-In-Binary-Tree.kt)</div>} | _{<div align='center'>[✔️](python%2F1448-count-good-nodes-in-binary-tree.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F1448-count-good-nodes-in-binary-tree.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F1448-count-good-nodes-in-binary-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F1448-Count-Good-Nodes-in-Binary-Tree.ts)</div>}