resource.h

数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树

//{{NO_DEPENDENCIES}}
// Microsoft Developer Studio generated include file.
// Used by BST.rc
//
#define IDM_ABOUTBOX                    0x0010
#define IDD_ABOUTBOX                    100
#define IDS_ABOUTBOX                    101
#define IDD_BST_DIALOG                  102
#define IDR_MAINFRAME                   128
#define IDD_DIALOG1                     130
#define IDC_BUTTON_INPUTDATA            1000
#define IDC_INPUT_DATA                  1001
#define IDC_OUTPUT_DATA                 1002
#define IDC_WHETHER_AVL                 1003
#define IDC_ASL1                        1004
#define IDC_ASL2                        1005
#define IDC_EDIT_ELEMENT                1007
#define IDC_BUTTON_NEXT                 1008
#define IDC_BUTTON_CANCEL               1009
#define IDC_STATIC_NUMBER               1010

// Next default values for new objects
// 
#ifdef APSTUDIO_INVOKED
#ifndef APSTUDIO_READONLY_SYMBOLS
#define _APS_NEXT_RESOURCE_VALUE        131
#define _APS_NEXT_COMMAND_VALUE         32772
#define _APS_NEXT_CONTROL_VALUE         1012
#define _APS_NEXT_SYMED_VALUE           101
#endif
#endif