交大110 資料結構與演算法第16題｜資料結構 Ch5 樹狀結構

資料結構›Ch5 樹狀結構

第 28 題／共 48 題

28. Binary Search Tree、Parent/Child Functions

#DS-05-028易Binary Search TreeParent/Child Functions

This question is about binary search trees. All the keys are unique. Let x be a tree node, $parent[x]$ be the parent of x, $left[x]$ be the left child of x, $right[x]$ be the right child of x, and $key[x]$ be the key of x. Assume that the root of a binary search tree has left and right children. The key of the root is greater than the key of the left child but the key of the root is smaller than the key of the right child. Which of the following statement(s) is(are) true for binary search trees?

📄 交大110

▤完整推導請見《WH 資工筆記 · 資料結構》Ch5 樹狀結構

本章題號 · 21–40 / 48