Trees / Binary Heaps Flashcards
(5 cards)
1
Q
Min Binary Heap
A
a complete binary tree where the value of each node is less than or equal to the values of its children
2
Q
Max Binary Heap
A
a complete binary tree where the value of each node is greater than or equal to the values of its children
3
Q
AVL Tree
A
a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one
4
Q
Binary Search Tree
A
a specialized binary tree data structure where each node contains a key, and the keys in the left subtree of a node are less than or equal to the node’s key, while the keys in the right subtree are greater than the node’s key.
5
Q
Binary Tree
A
a hierarchical structure where each node has at most two child nodes, typically referred to as the left child and the right child
