Tree in Python with Tests

Tree holds 149 problems (35 Easy, 101 Medium, 13 Hard). Generate any of them into the current directory with lcpy gen -n <number>.

#	Problem	Difficulty	Solution
94	Binary Tree Inorder Traversal	Easy	solution.py
95	Unique Binary Search Trees II	Medium	solution.py
96	Unique Binary Search Trees	Medium	solution.py
98	Validate Binary Search Tree	Medium	solution.py
99	Recover Binary Search Tree	Medium	solution.py
100	Same Tree	Easy	solution.py
101	Symmetric Tree	Easy	solution.py
102	Binary Tree Level Order Traversal	Medium	solution.py
103	Binary Tree Zigzag Level Order Traversal	Medium	solution.py
104	Maximum Depth of Binary Tree	Easy	solution.py
105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	solution.py
106	Construct Binary Tree from Inorder and Postorder Traversal	Medium	solution.py
107	Binary Tree Level Order Traversal II	Medium	solution.py
108	Convert Sorted Array to Binary Search Tree	Easy	solution.py
109	Convert Sorted List to Binary Search Tree	Medium	solution.py
110	Balanced Binary Tree	Easy	solution.py
111	Minimum Depth of Binary Tree	Easy	solution.py
112	Path Sum	Easy	solution.py
113	Path Sum II	Medium	solution.py
114	Flatten Binary Tree to Linked List	Medium	solution.py
116	Populating Next Right Pointers In Each Node	Medium	solution.py
117	Populating Next Right Pointers in Each Node II	Medium	solution.py
124	Binary Tree Maximum Path Sum	Hard	solution.py
129	Sum Root to Leaf Numbers	Medium	solution.py
144	Binary Tree Preorder Traversal	Easy	solution.py
145	Binary Tree Postorder Traversal	Easy	solution.py
156	Binary Tree Upside Down	Medium	solution.py
173	Binary Search Tree Iterator	Medium	solution.py
199	Binary Tree Right Side View	Medium	solution.py
222	Count Complete Tree Nodes	Medium	solution.py
226	Invert Binary Tree	Easy	solution.py
230	Kth Smallest Element in a BST	Medium	solution.py
235	Lowest Common Ancestor of a Binary Search Tree	Medium	solution.py
236	Lowest Common Ancestor of a Binary Tree	Medium	solution.py
250	Count Univalue Subtrees	Medium	solution.py
255	Verify Preorder Sequence in Binary Search Tree	Medium	solution.py
257	Binary Tree Paths	Easy	solution.py
270	Closest Binary Search Tree Value	Easy	solution.py
272	Closest Binary Search Tree Value II	Hard	solution.py
285	Inorder Successor in BST	Medium	solution.py
297	Serialize and Deserialize Binary Tree	Hard	solution.py
298	Binary Tree Longest Consecutive Sequence	Medium	solution.py
314	Binary Tree Vertical Order Traversal	Medium	solution.py
331	Verify Preorder Serialization of a Binary Tree	Medium	solution.py
333	Largest BST Subtree	Medium	solution.py
337	House Robber III	Medium	solution.py
341	Flatten Nested List Iterator	Medium	solution.py
366	Find Leaves of Binary Tree	Medium	solution.py
404	Sum of Left Leaves	Easy	solution.py
426	Convert Binary Search Tree to Sorted Doubly Linked List	Medium	solution.py
427	Construct Quad Tree	Medium	solution.py
428	Serialize and Deserialize N-ary Tree	Hard	solution.py
429	N-ary Tree Level Order Traversal	Medium	solution.py
431	Encode N-ary Tree to Binary Tree	Hard	solution.py
437	Path Sum III	Medium	solution.py
449	Serialize and Deserialize BST	Medium	solution.py
450	Delete Node in a BST	Medium	solution.py
501	Find Mode in Binary Search Tree	Easy	solution.py
508	Most Frequent Subtree Sum	Medium	solution.py
510	Inorder Successor in BST II	Medium	solution.py
513	Find Bottom Left Tree Value	Medium	solution.py
515	Find Largest Value in Each Tree Row	Medium	solution.py
530	Minimum Absolute Difference in BST	Easy	solution.py
536	Construct Binary Tree from String	Medium	solution.py
538	Convert BST to Greater Tree	Medium	solution.py
543	Diameter of Binary Tree	Easy	solution.py
545	Boundary of Binary Tree	Medium	solution.py
549	Binary Tree Longest Consecutive Sequence II	Medium	solution.py
558	Logical OR of Two Binary Grids Represented as Quad-Trees	Medium	solution.py
559	Maximum Depth of N-ary Tree	Easy	solution.py
563	Binary Tree Tilt	Easy	solution.py
572	Subtree of Another Tree	Easy	solution.py
582	Kill Process	Medium	solution.py
589	N-ary Tree Preorder Traversal	Easy	solution.py
590	N-ary Tree Postorder Traversal	Easy	solution.py
606	Construct String from Binary Tree	Medium	solution.py
617	Merge Two Binary Trees	Easy	solution.py
623	Add One Row to Tree	Medium	solution.py
637	Average of Levels in Binary Tree	Easy	solution.py
652	Find Duplicate Subtrees	Medium	solution.py
653	Two Sum IV - Input is a BST	Easy	solution.py
654	Maximum Binary Tree	Medium	solution.py
655	Print Binary Tree	Medium	solution.py
662	Maximum Width of Binary Tree	Medium	solution.py
663	Equal Tree Partition	Medium	solution.py
666	Path Sum IV	Medium	solution.py
669	Trim a Binary Search Tree	Medium	solution.py
671	Second Minimum Node In a Binary Tree	Easy	solution.py
687	Longest Univalue Path	Medium	solution.py
690	Employee Importance	Medium	solution.py
700	Search in a Binary Search Tree	Easy	solution.py
701	Insert into a Binary Search Tree	Medium	solution.py
703	Kth Largest Element in a Stream	Easy	solution.py
742	Closest Leaf in a Binary Tree	Medium	solution.py
776	Split BST	Medium	solution.py
783	Minimum Distance Between BST Nodes	Easy	solution.py
814	Binary Tree Pruning	Medium	solution.py
834	Sum of Distances in Tree	Hard	solution.py
863	All Nodes Distance K in Binary Tree	Medium	solution.py
865	Smallest Subtree with all the Deepest Nodes	Medium	solution.py
872	Leaf-Similar Trees	Easy	solution.py
889	Construct Binary Tree from Preorder and Postorder Traversal	Medium	solution.py
894	All Possible Full Binary Trees	Medium	solution.py
897	Increasing Order Search Tree	Easy	solution.py
919	Complete Binary Tree Inserter	Medium	solution.py
938	Range Sum of BST	Easy	solution.py
951	Flip Equivalent Binary Trees	Medium	solution.py
958	Check Completeness of a Binary Tree	Medium	solution.py
965	Univalued Binary Tree	Easy	solution.py
968	Binary Tree Cameras	Hard	solution.py
971	Flip Binary Tree To Match Preorder Traversal	Medium	solution.py
979	Distribute Coins in Binary Tree	Medium	solution.py
987	Vertical Order Traversal of a Binary Tree	Hard	solution.py
988	Smallest String Starting From Leaf	Medium	solution.py
993	Cousins in Binary Tree	Easy	solution.py
998	Maximum Binary Tree II	Medium	solution.py
1028	Recover a Tree From Preorder Traversal	Hard	solution.py
1110	Delete Nodes And Return Forest	Medium	solution.py
1120	Maximum Average Subtree	Medium	solution.py
1214	Two Sum BSTs	Medium	solution.py
1245	Tree Diameter	Medium	solution.py
1273	Delete Tree Nodes	Medium	solution.py
1325	Delete Leaves With a Given Value	Medium	solution.py
1361	Validate Binary Tree Nodes	Medium	solution.py
1367	Linked List in Binary Tree	Medium	solution.py
1376	Time Needed to Inform All Employees	Medium	solution.py
1443	Minimum Time to Collect All Apples in a Tree	Medium	solution.py
1448	Count Good Nodes in Binary Tree	Medium	solution.py
1457	Pseudo-Palindromic Paths in a Binary Tree	Medium	solution.py
1490	Clone N-ary Tree	Medium	solution.py
1506	Find Root of N-Ary Tree	Medium	solution.py
1522	Diameter of N-Ary Tree	Medium	solution.py
1530	Number of Good Leaf Nodes Pairs	Medium	solution.py
1609	Even Odd Tree	Medium	solution.py
1650	Lowest Common Ancestor of a Binary Tree III	Medium	solution.py
1993	Operations on Tree	Medium	solution.py
2096	Step-By-Step Directions From a Binary Tree Node to Another	Medium	solution.py
2196	Create Binary Tree From Descriptions	Medium	solution.py
2331	Evaluate Boolean Binary Tree	Easy	solution.py
2415	Reverse Odd Levels of Binary Tree	Medium	solution.py
2421	Number of Good Paths	Hard	solution.py
2467	Most Profitable Path in a Tree	Medium	solution.py
2471	Minimum Number of Operations to Sort a Binary Tree by Level	Medium	solution.py
2477	Minimum Fuel Cost to Report to the Capital	Medium	solution.py
2583	Kth Largest Sum in a Binary Tree	Medium	solution.py
2641	Cousins in Binary Tree II	Medium	solution.py
2872	Maximum Number of K-Divisible Components	Hard	solution.py
3068	Find the Maximum Sum of Node Values	Hard	solution.py
3203	Find Minimum Diameter After Merging Two Trees	Hard	solution.py

Welcome

Getting Started

Practice

CLI

Catalog

Contributing

Troubleshooting

Tree in Python with Tests