BST

Question 1

Balanced

Answer 1

A binary tree is balanced only if the height of any given node’s right subtree and left subtree differ by no more than 1

Question 2

height

Answer 2

The height of a node is the number of nodes from the root to the deepest leaf.
The height of a tree is a height of the root.

Question 3

size

Answer 3

number of nodes

Question 4

complete

Answer 4

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible

Question 5

proper

Answer 5

A Proper binary tree.is a binary tree in which each node has exactly zero or two children.

Question 6

Max Heap

Answer 6

heap is a binary tree (not a bst)
complete at all times, so insert left to right without comparison

Max heap the parent is bigger and min heap the parent is smaller.

first insertion is to the left because it’s complete at all times, second is to the right for the same reasons and so on, there’s no comparison for insertion

after each insertion you check if the parent is the min/max constraint is satisfied, if not, swap them

After a swap check the constraint again and swap again until the constraint is satisfied

Question 7

AVL left rotation

Answer 7

see AVL folder

Question 8

AVL Right Rotation

Answer 8

see AVL folder

Question 9

AVL Left-right

Answer 9

See AVL Folder

Question 10

AVL Right Left

Answer 10

see AVL Folder

Question 11

Full

Answer 11

A Full binary tree.is a binary tree in which each node has exactly zero or two children AND the leaves are all on the same level, IE proper, balanced, and complete

Question 12

inorder, preorder, postorder

Answer 12

Inorder: left, root, right
preorder: Root, left, right
Postorder: left, right, post