Binary tree Flashcards

1
Q

Binary Tree maximum path sum

A

You know it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Height of Binary Tree after Subtree Removal Queries - G

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Number of good leaf nodes pairs

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Diameter of binary tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Validate binary search tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Serialize and deserialize N-ary tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Serialize and deserialize binary tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Equal tree partition

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Symmetric tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Count nodes equal to average of subtree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Delete nodes and return forest

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Construct string from binary tree

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Lowest common ancestor

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Lowest common ancestor - when nodes may not may not exist

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Lowest common ancestor - with pointer to parent and nodes as input

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Lowest common ancestor - when N nodes all exist

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Construct binary from preorder and in order traversal

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Find largest value in each tree row

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Binary tree right side view

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Binary tree vertical order traversal

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Binary tree level order traversal

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Binary tree level order traversal - bottom up

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Binary tree preorder

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Binary tree in order

A

You know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Binary tree post order
You know it
26
Convert binary search tree to sorted double linked list
You know it
27
Flatten binary tree to linked list preorder
You know it
28
K-th smallest value in BST
You know it, in order traversal
29
Delete node in a BST
You know it
30
Delete subtree that sums to 0 and return number of nodes that remain
You know it
31
Invert binary tree - the mirror of tree
You know it
32
Binary tree return all paths to leaves
You know it
33
Collect leaves and remove leaves of binary tree - G
You know it, tree height
34
Reverse odd levels of binary tree
You know it
35
Print binary tree in matrix
You know it
36
Find mode in binary search tree (the most frequently occurred element)
You know it
37
Sum of distances for all nodes in tree - G
You know it
38
Find number of coins to place in tree nodes - G
You know it
39
House Robber III - cannot take directly linked house
You may not know it well
40
Construct binary tree from string with parentheses - F
You may not know it
41
Binary Tree Vertical Traversal - sorted by value in the same row
42
Binary search tree iterator
You know it
43
Undirected graph valid tree
You know it
44
Minimum height trees - G, F
You know it
45
Boundary of binary tree - F
You know it
46
Merge two binary trees
You know it
47
Average of levels in binary tree
You know it
48
Longest univalue path in binary tree - F
You know it
49
Smallest subtree with all the deepest nodes - F
You know it
50
All nodes with distance K from a target node (not root) in binary tree
You know it
51
Add nodes into complete binary tree
You know it
52
Range sum of binary search tree
You know it
53
Construct binary search tree from preorder traversal - F
You know it
54
Recover a tree from preorder traversal with dash - F
You know it
55
Undirected tree diameter - F
You know it
56
Balance binary search tree
You know it
57
Check if a binary tree is balanced
You know it
58
Closest binary search tree value
You know it
59
Populate next right pointers in each node - G
You know it
60
Sum root to leaf numbers - F
You know it
61
Diameter of N-ary tree - F
You know it
62
Maximum level sum of binary tree - F
You know it
63
Binary tree zigzag level traversal - G, F
You know it
64
Check completeness of binary tree - F
You know it
65
Minimum time to collect all apples in tree - F
You know it
66
Binary tree path sum equal to target
You know it