yep

Question 1

What are the properties of red-black trees?

Answer 1

• Every node must be black or red.
• The root MUST be black
• If a node is red, its children must be black.
• Every leaf is NULL and both its children are black.
• All simple paths from the node to descendant leaves contain the same number of BLACK nodes.

Question 1

What is a complete binary tree?

Answer 1

binary tree such that every level of the tree has the maximum of nodes possible expect for the leaf level (deepest level)

Question 2

What is a full binary tree?

Answer 2

All leaves have the same depth and every nonleaf node has two children

Question 3

What are 2-3-4 trees?

Answer 3

self balance trees, internal nodes can have 2,3, or 4 children (1,2,3 elements or keys), with leaf nodes in sorted order,

Question 4

How would you convert a 2-3-4 tree to a red black tree?

Answer 4

2- node is just a black node. 3nodes is a black node with red child. 4 node is a black node with 2 red children.

Question 5

What are b tree’s?

Answer 5

node’s contaning multiple keys that ensure each node has min num of keys. max num of elements is twice the min. every leaf in a B tree MUST have same height/depth (balancing)

Question 6

What are invariants in hashing, and why are they important?

Answer 6

properties or rules that remain unchanged during the execution of hashing algorithms.