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.
173 lines
7.6 KiB
173 lines
7.6 KiB
6 years ago
|
---
|
||
|
|
id: tree
|
||
|
3 years ago
|
title: Tree cheatsheet for coding interviews
|
||
|
|
description: Tree study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||
|
|
keywords:
|
||
|
|
[
|
||
|
|
tree coding interview study guide,
|
||
|
|
tree tips for coding interviews,
|
||
|
|
tree practice questions,
|
||
|
|
tree useful techniques,
|
||
|
|
tree time complexity,
|
||
|
|
tree recommended study resources,
|
||
|
|
]
|
||
|
|
sidebar_label: Tree
|
||
|
3 years ago
|
toc_max_heading_level: 2
|
||
|
6 years ago
|
---
|
||
|
7 years ago
|
|
||
|
3 years ago
|
<head>
|
||
|
|
<meta property="og:image" content="https://www.techinterviewhandbook.org/social/algorithms/algorithms/algorithms-tree.png" />
|
||
|
|
</head>
|
||
|
|
|
||
|
3 years ago
|
## Introduction
|
||
|
6 years ago
|
|
||
|
3 years ago
|
A tree is a widely used abstract data type that represents a hierarchical structure with a set of connected nodes. Each node in the tree can be connected to many children, but must be connected to exactly one parent, except for the root node, which has no parent.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
A tree is an undirected and connected acyclic graph. There are no cycles or loops. Each node can be like the root node of its own subtree, making [recursion](recursion.md) a useful technique for tree traversal.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
For the purpose of interviews, you will usually be asked on binary trees as opposed to ternary (3 children) or N-ary (N children) trees. In this page,we will cover binary trees and binary search trees, which is a special case of binary trees.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
Trees are commonly used to represent hierarchical data, e.g. file systems, JSON, and HTML documents. Do check out the section on [Trie](trie.md), which is an advanced tree used for efficiently storing and searching strings.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
## Learning resources
|
||
|
|
|
||
|
|
- Videos
|
||
|
|
- [Trees](https://www.coursera.org/lecture/data-structures/trees-95qda), University of California San Diego
|
||
|
|
- Readings
|
||
|
|
- [How To Not Be Stumped By Trees](https://medium.com/basecs/how-to-not-be-stumped-by-trees-5f36208f68a7), basecs
|
||
|
|
- [Leaf It Up To Binary Trees](https://medium.com/basecs/leaf-it-up-to-binary-trees-11001aaf746d), basecs
|
||
|
|
- Additional (only if you have time)
|
||
|
|
- [The Little AVL Tree That Could](https://medium.com/basecs/the-little-avl-tree-that-could-86a3cae410c7), basecs
|
||
|
|
- [Busying Oneself With B-Trees](https://medium.com/basecs/busying-oneself-with-b-trees-78bbf10522e7), basecs
|
||
|
|
- [Painting Nodes Black With Red-Black Trees](https://medium.com/basecs/painting-nodes-black-with-red-black-trees-60eacb2be9a5), basecs
|
||
|
|
|
||
|
3 years ago
|
## Common terms you need to know
|
||
|
6 years ago
|
|
||
|
3 years ago
|
- **Neighbor** - Parent or child of a node
|
||
|
|
- **Ancestor** - A node reachable by traversing its parent chain
|
||
|
|
- **Descendant** - A node in the node's subtree
|
||
|
|
- **Degree** - Number of children of a node
|
||
|
|
- **Degree** of a tree - Maximum degree of nodes in the tree
|
||
|
|
- **Distance** - Number of edges along the shortest path between two nodes
|
||
|
|
- **Level/Depth** - Number of edges along the unique path between a node and the root node
|
||
|
|
- **Width** - Number of nodes in a level
|
||
|
6 years ago
|
|
||
|
3 years ago
|
### Binary tree
|
||
|
6 years ago
|
|
||
|
3 years ago
|
Binary means two, so nodes in a binary trees have a maximum of two children.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
**Binary tree terms**
|
||
|
|
|
||
|
|
- Complete binary tree - A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.
|
||
|
|
- Balanced binary tree - A binary tree structure in which the left and right subtrees of every node differ in height by no more than 1.
|
||
|
|
|
||
|
|
**Traversals**
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
Given such a tree, these are the results for the various traversals.
|
||
|
|
|
||
|
|
- **In-order traversal** - Left -> Root -> Right
|
||
|
|
- Result: 2, 7, 5, 6, 11, 1, 9, 5, 9
|
||
|
|
- **Pre-order traversal** - Root -> Left -> Right
|
||
|
|
- Result: 1, 7, 2, 6, 5, 11, 9, 9, 5
|
||
|
|
- **Post-order traversal** - Left -> Right -> Root
|
||
|
|
- Result: 2, 5, 11, 6, 7, 5, 9, 9, 1
|
||
|
|
|
||
|
|
Note that 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).
|
||
|
|
|
||
|
|
#### Time complexity
|
||
|
6 years ago
|
|
||
|
3 years ago
|
| Operation | Big-O |
|
||
|
|
| --------- | --------- |
|
||
|
|
| Access | O(log(n)) |
|
||
|
|
| Search | O(log(n)) |
|
||
|
|
| Insert | O(log(n)) |
|
||
|
|
| Remove | O(log(n)) |
|
||
|
|
|
||
3 years ago
|
Space complexity of traversing balanced trees is O(h) where h is the height of the tree, while traversing very skewed trees (which is essentially a linked list) will be O(n).
|
||
|
3 years ago
|
|
||
|
3 years ago
|
## Things to look out for during interviews
|
||
|
3 years ago
|
|
||
|
3 years ago
|
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.
|
||
|
6 years ago
|
|
||
|
|
## Corner cases
|
||
|
|
|
||
|
|
- Empty tree
|
||
|
|
- Single node
|
||
|
|
- Two nodes
|
||
|
|
- Very skewed tree (like a linked list)
|
||
|
|
|
||
|
3 years ago
|
## Common routines
|
||
|
6 years ago
|
|
||
|
3 years ago
|
Be familiar with the following routines because many tree questions make use of one or more of these routines in the solution:
|
||
|
6 years ago
|
|
||
|
3 years ago
|
- Insert value
|
||
|
|
- Delete value
|
||
|
|
- Count number of nodes in tree
|
||
|
|
- Whether a value is in the tree
|
||
|
|
- Calculate height of the tree
|
||
|
|
- Binary search tree
|
||
|
|
- Determine if is binary search tree
|
||
|
|
- Get maximum value
|
||
|
|
- Get minimum value
|
||
|
6 years ago
|
|
||
|
3 years ago
|
## Techniques
|
||
|
6 years ago
|
|
||
|
3 years ago
|
### Use recursion
|
||
|
|
|
||
|
|
Recursion is the most common approach for traversing 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`.
|
||
|
|
|
||
|
|
Sometimes it is possible that your recursive function needs to return two values.
|
||
|
|
|
||
|
|
### Traversing by level
|
||
|
|
|
||
|
|
When you are asked to traverse a tree by level, use breadth-first search.
|
||
|
|
|
||
|
|
### Summation of nodes
|
||
|
|
|
||
|
|
If the question involves summation of nodes along the way, be sure to check whether nodes can be negative.
|
||
|
6 years ago
|
|
||
|
3 years ago
|
## Essential questions
|
||
|
3 years ago
|
|
||
|
3 years ago
|
_These are essential questions to practice if you're studying for this topic._
|
||
|
|
|
||
|
|
- Binary Tree
|
||
|
3 years ago
|
- [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
|
||
|
|
- [Invert/Flip Binary Tree](https://leetcode.com/problems/invert-binary-tree/)
|
||
|
3 years ago
|
- Binary Search Tree
|
||
|
|
- [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
|
||
|
|
|
||
|
|
## Recommended practice questions
|
||
|
|
|
||
|
|
_These are recommended questions to practice after you have studied for the topic and have practiced the essential questions._
|
||
|
|
|
||
|
|
- Binary tree
|
||
|
|
- [Same Tree](https://leetcode.com/problems/same-tree/)
|
||
|
3 years ago
|
- [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/)
|
||
|
|
- [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)
|
||
|
|
- [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)
|
||
|
|
- [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/)
|
||
|
|
- [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
|
||
|
|
- Binary search tree
|
||
|
|
- [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/)
|
||
|
3 years ago
|
|
||
|
|
## Recommended courses
|
||
|
|
|
||
|
|
import AlgorithmCourses from '../\_courses/AlgorithmCourses.md'
|
||
|
|
|
||
|
|
<AlgorithmCourses />
|