Application of general tree structure for readily modifiable UI menu structure
Young‐Chul Kim, Taek-Yong Kim · 2005
In this paper, considerations on the algorithm that makes the use of general tree structure to enable readily modifiable UI menu structure in an efficient way in terms of time and resource (available memory) of CPUs are described. First, it describes the importance of UI (user interface) and why UI menu structure must be readily modifiable. Following chapter introduces a few data structure as well as general tree type and why general tree is used to meet the goal. Then, source code written in C illustrates how the general tree is used to be able to modify the UI menu structure with some of examples. The primary goal of the algorithm is to help end-users and programmers to be able to modify the UI menu structure. For the end-users, the algorithm lets CPUs finish the task (modifying UI menu structure) instantaneously so that the user is not annoyed with waiting time. For the algorithm is very simple, programmers can use the algorithm easily