阿摩線上測驗 登入

申論題資訊

試卷:106年 - 106 國立中山大學_碩士班招生考試_電機系(丙組):資料結構#110221
科目:中山◆電機◆資料結構
年份:106年
排序:0

題組內容

5.[15] Let one-node binary tree have a depth of 1. Suppose we have a complete binary tree T of depth 100.

申論題內容

5.4 [3] Suppose we number the nodes T by starting with the node on level 1, and continuing with the nodes on level 2, and so on. Nodes on any level are numbered from left to right. Let the first node be numbered 1, the second node be numbered 2, and so on. For a node numbered 200, what is its left node numbered?