Tom的专栏

递归实现二叉树（插入、搜索）// Binary Search Tree - Implemenation in C++// Simple program to create a BST of integers and search an element in it #include<iostream>using namespace std;//Definition of N...

根据 位置 删除节点#include<iostream>struct ListNode{ int m_nValue; ListNode* m_pNext;};ListNode* AddToTail(ListNode** pHead, int Value){ ListNode* pNew = new ListNode(); pNew-&g...

查找节点（中序搜索） /* C++ program to find Inorder successor in a BST */#include&lt;iostream&gt;using namespace std;struct Node { int data; struct Node *left; struct Node *right;};//Function to fin...

 删除节点/* Deleting a node from Binary search tree */#include&lt;iostream&gt;using namespace std;struct Node { int data; struct Node *left; struct Node *right;};//Function to find minimum in a...

用数组实现队列/* Queue - Circular Array implementation in C++*/#include&lt;iostream&gt;using namespace std; #define MAX_SIZE 101 //maximum size of the array that will store Queue. // Creating a clas...

从尾部打印头部栈 - 实现：void printListReversingly_Iteratively(ListNode** pHead){ std::stack&lt;ListNode*&gt; nodes; ListNode* pNode = *pHead; while(pNode!=nullptr){ nodes.push(pNo...

头部插入#include&lt;iostream&gt;struct ListNode{ int m_nValue; ListNode* m_pNext;};void AddToTop(ListNode** pHead, int Value){ ListNode* pNew = new ListNode(); pNew-&gt;m_nValue =...

深度优先遍历/* Binary Tree Traversal - Preorder, Inorder, Postorder */#include&lt;iostream&gt;using namespace std; struct Node { char data; struct Node *left; struct Node *right;};//Function to...

层级顺序遍历二叉树 /* Binary tree - Level Order Traversal */#include&lt;iostream&gt;#include&lt;queue&gt;using namespace std;struct Node { char data; Node *left; Node *right;};// Function to prin...

 用链表实现队列/*Queue - Linked List implementation*/#include&lt;stdio.h&gt;#include&lt;stdlib.h&gt;struct Node { int data; struct Node* next;};// Two glboal variables to store address of front and...