so i want to make a code, that creates a binary tree, that holds data, for example ints like 1,6,2,10,8 and on pop i get the biggest number, and after that it gets deleted from the tree, and on push i can insert a new element. And this should be in a

栈这种数据结构是一个工具性的数据结构，通常被其它复杂数据结构所使用。比如实现二叉树的遍历的非递归算法。下面就用C++模板实现栈数据结构的一个较完整代码！在书本《数据结构（C语言版）--严慰明》提到栈可以用数组，也可以用链表实现，这里只用链表实现这一数据结构。-This data structure is a stack instrumental data structure is often used for other complex data structures. Such as a bi