You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
68 lines
2.9 KiB
68 lines
2.9 KiB
---
|
|
id: tree
|
|
title: Tree
|
|
---
|
|
|
|
## Study links
|
|
|
|
- [Leaf It Up To Binary Trees](https://medium.com/basecs/leaf-it-up-to-binary-trees-11001aaf746d)
|
|
|
|
## Notes
|
|
|
|
A tree is an undirected and connected acyclic graph.
|
|
|
|
Recursion is a common approach for trees. When you notice that the subtree problem can be used to solve the entire problem, try using recursion.
|
|
|
|
When using recursion, always remember to check for the base case, usually where the node is `null`.
|
|
|
|
When you are asked to traverse a tree by level, use breadth-first search.
|
|
|
|
Sometimes it is possible that your recursive function needs to return two values.
|
|
|
|
If the question involves summation of nodes along the way, be sure to check whether nodes can be negative.
|
|
|
|
You should be very familiar with writing pre-order, in-order, and post-order traversal recursively. As an extension, challenge yourself by writing them iteratively. Sometimes interviewers ask candidates for the iterative approach, especially if the candidate finishes writing the recursive approach too quickly.
|
|
|
|
Do check out the section on [Trie](trie.md), which is an advanced tree.
|
|
|
|
## Corner cases
|
|
|
|
- Empty tree
|
|
- Single node
|
|
- Two nodes
|
|
- Very skewed tree (like a linked list)
|
|
|
|
## Special Trees
|
|
|
|
### Binary Tree
|
|
|
|
In-order traversal of a binary tree is insufficient to uniquely serialize a tree. Pre-order or post-order traversal is also required.
|
|
|
|
### Binary Search Tree (BST)
|
|
|
|
In-order traversal of a BST will give you all elements in order.
|
|
|
|
Be very familiar with the properties of a BST and validating that a binary tree is a BST. This comes up more often than expected.
|
|
|
|
When a question involves a BST, the interviewer is usually looking for a solution which runs faster than O(n).
|
|
|
|
## Recommended LeetCode questions
|
|
|
|
- [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
|
|
- [Same Tree](https://leetcode.com/problems/same-tree/)
|
|
- [Invert/Flip Binary Tree](https://leetcode.com/problems/invert-binary-tree/)
|
|
- [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)
|
|
- [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)
|
|
- [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
|
|
- [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)
|
|
- [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
|
|
- [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)
|
|
- [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)
|
|
- [Lowest Common Ancestor of BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
|
|
|
|
## Recommended courses
|
|
|
|
import AlgorithmCourses from '../\_courses/AlgorithmCourses.md'
|
|
|
|
<AlgorithmCourses />
|