Finish Tree section of LC problems
Wahoo! I need to remember that the inorder traversal of a BST should be
sorted. This piece of trivia comes in handy for a variety of BST related
problems.
I also think being able to do a {pre,in,post}-order traversal recursively and
iteratively is a skill that I need to develop.
			
			
This commit is contained in:
		
							parent
							
								
									93d7b5d8ea
								
							
						
					
					
						commit
						1783f371e9
					
				
					 1 changed files with 3 additions and 3 deletions
				
			
		|  | @ -140,11 +140,11 @@ | ||||||
|    https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ |    https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ | ||||||
| ** DONE Subtree of Another Tree | ** DONE Subtree of Another Tree | ||||||
|    https://leetcode.com/problems/subtree-of-another-tree/ |    https://leetcode.com/problems/subtree-of-another-tree/ | ||||||
| ** TODO Construct Binary Tree from Preorder and Inorder Traversal | ** DONE Construct Binary Tree from Preorder and Inorder Traversal | ||||||
|    https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ |    https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ | ||||||
| ** TODO Validate Binary Search Tree | ** DONE Validate Binary Search Tree | ||||||
|    https://leetcode.com/problems/validate-binary-search-tree/ |    https://leetcode.com/problems/validate-binary-search-tree/ | ||||||
| ** TODO Kth Smallest Element in a BST | ** DONE Kth Smallest Element in a BST | ||||||
|    https://leetcode.com/problems/kth-smallest-element-in-a-bst/ |    https://leetcode.com/problems/kth-smallest-element-in-a-bst/ | ||||||
| ** DONE Lowest Common Ancestor of BST | ** DONE Lowest Common Ancestor of BST | ||||||
|    https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ |    https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ | ||||||
|  |  | ||||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue