Search - 2-3-4 tree

Search - 2-3-4 tree - List

[Console] shujujiegou DL : 0: 1.实现顺序表的基本操作，包括顺序表的初始化、第i个元素前插入一个新的元素、删除第i个元素、查找某元素、顺序表的销毁。2.实现单链表、循环链表、双向链表的所有基本操作 3.定义顺序栈类型，实现栈的所有基本操作。定义链栈类型，实现栈的所有基本操作。应用栈实现数制的转换。4.定义顺序队列类型，实现栈的所有基本操作。定义链队列类型，实现栈的所有基本操作。将字符串转换为整形。5.定义二叉链表类型，建立二叉树。先序、中序、后序、层次遍历二叉树，并输出遍历结果。-1. Achieve the basic operation of the sequence table, including the initialization sequence table prior to insert a new element in the i-th element, delete the i-th element, find an element, the destruction of the sequence table. Single linked list, circular linked list, doubly linked list of all basic operations. Define the order of the stack type, stack all the basic operations. The definition of the type of chain stack, all the basic operations of the stack. The application stack to achieve the number system conversion. 4 defined order queue type stack all the basic operations. Defined the chain queue type, and all the basic operations of the stack. To convert a string of plastic surgery. 5. Defined the binary list type, the establishment of a binary tree. The first sequence, sequence after sequence, levels of the binary tree traversal and output loop through the results.
Date : 2025-12-17 Size : 10kb User : ludan
[Console] binary-tree DL : 0: （1）输入字符序列，建立二叉链表。（2）先序、中序、后序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法。（最好也能实现先序、后序非递归算法）（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）借助队列实现二叉树的层次遍历。（7）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence to build binary list. (2) first order, in sequence, after the binary tree traversal: recursive algorithm. (3) traversal of a binary tree: non-recursive algorithm. (Preferably also able to achieve the first sequence, after the non-recursive algorithm) (4) binary tree of height. (5) the number of tree leaves. (6) With the level of a binary tree traversal queue. (7) in the main function to design a simple menu, respectively debugging the above algorithm.
Date : 2025-12-17 Size : 2kb User : fei