DATA STRUCTURES STUDY SHEET SOLVED
QUESTIONS AND CORRECT ANSWERS
VERIFIED PREP CONTENT
●● BST Search Average
Answer: O(log n)
●● BST Search Worst
Answer: O(n)
●● BST Insert Average
Answer: O(log n)
●● BST Insert Worst
Answer: O(n)
●● BST Delete Average
Answer: O(log n)
●● BST Delete Worst
Answer: O(n)
, ●● Balanced Tree
Answer: Tree with roughly equal left/right subtree heights
●● Skewed Tree
Answer: Tree that behaves like a linked list
●● Inorder Traversal
Answer: Left Root Right
●● Preorder Traversal
Answer: Root Left Right
●● Postorder Traversal
Answer: Left Right Root
●● Inorder Traversal Property
Answer: Produces sorted order in a BST
●● AVL Tree
Answer: Self-balancing binary search tree
QUESTIONS AND CORRECT ANSWERS
VERIFIED PREP CONTENT
●● BST Search Average
Answer: O(log n)
●● BST Search Worst
Answer: O(n)
●● BST Insert Average
Answer: O(log n)
●● BST Insert Worst
Answer: O(n)
●● BST Delete Average
Answer: O(log n)
●● BST Delete Worst
Answer: O(n)
, ●● Balanced Tree
Answer: Tree with roughly equal left/right subtree heights
●● Skewed Tree
Answer: Tree that behaves like a linked list
●● Inorder Traversal
Answer: Left Root Right
●● Preorder Traversal
Answer: Root Left Right
●● Postorder Traversal
Answer: Left Right Root
●● Inorder Traversal Property
Answer: Produces sorted order in a BST
●● AVL Tree
Answer: Self-balancing binary search tree
