2。
一棵二叉树的中序序列是“有序的”能否推断出===》“此二叉树为BST”？

3。考试中 算法题：如果函数的英语单词不会拼写，可否用拼音代替？（会不会影响得分，比如函数名等）

2。
一棵二叉树的中序序列是“有序的”能否推断出===》“此二叉树为BST”？

     按照习题集的解法，能。
     不过我觉得习题集采用的中序周游判定BST的解法，似乎对关键码重复的情况有问题？
3。考试中 算法题：如果函数的英语单词不会拼写，可否用拼音代替？（会不会影响得分，比如函数名等）

    最好不用拼音，不会写的单词用几个字母缩写，用别的英语名字也行。据说数据结构判卷子经常要提分：）

Rene de la Briandais proposed his tree in the context of file searching during a 1959
Western Joint Computer Conference (WJCC).  A de la Briandais tree is a positional tree
in which there are paths from root to a leaf corresponding only to actual keys in a keyset.  
This is to be distinguished from another type of positional tree, called a trie, in which
the number of paths is intermediate to the number of possible or actual keys.  
A de la Briandais tree is a positional tree with character nodes in which keys
correspond to paths from root to leafs and every leaf represents a key.

------------------------------------------------------------------------------------------

Fig1.:    A Node of a de la Briandais tree:
            node = { *child pointer, key, *sibling pointer }

    __________________________________
    |          |           |          |
    |Child     |           |Sybling   |
    |Pointer   |KEY        |Pointer   |------------------->
    |   []     |[letter]   | []       |
    |__________|___________|__________|
         |                                           
         |                                           
         |                                           
         V        

------------------------------------------------------------------------------------------
Fig2.:  A de la Briandais tree for the keys:  hal, hul, hem, tan, tin, tim, ted

|
|
V
[][h][] ---------->[][t][]---->(N)
|                 |                                                                                                           
|                 |                
V                 V
[][a][]-->(N)     [][a][]------------>[][i][]-------------------------->[][e][]---->(N)
|                 |                  |                                 |                            
|                 |                  |                                 |                            
V                 V                  V                                 V                          
[][l][]-->(N)     [][n][]---->(N)    [][n][]-->[][m][]-->(N)         [][d][]-->(N)      
|                 |                 |          |                    |
|                 |                 |          |                    |
V                 V                 V          V                    V
[][$][]            [][$][]          [][$][]    [][$][]              [][$][]

where:
(N)          =     Null Pointer
[][$][]       =     end of word marker, whose sibling and child_pointer are both Null.
-------------------------------------------------------------------------------------------

ALGORITHMS/IMPLEMENTATION:

The following are algorithms that I wrote for INSERTION, DELETION, and MEMBER:

反正我是看不下去~~~~

     按照习题集的解法，能。
     不过我觉得习题集采用的中序周游判定BST的解法，似乎对关键码重复的情况有问题？
”
能证明下么，谢谢