0
谁能解释的答案二进制搜索,二叉搜索树问答题
A binary search tree (BST) is built by inserting tree following
values in the given order: 4,25,15,12,20,70,40.
The Post Order Traversal will be
A. 12, 15, 20, 40,70,25, 4
B. 12,20, 15,40, 70,25, 4
C. 4,25, 70, 40,15, 12,20
D. 4,12, 15, 20, 25,40,70
我尝试了答案。但我力求得到它。