Passion

#include using namespace std; struct BinaryTreeNode { int m_nValue; BinaryTreeNode* m_pLeft; BinaryTreeNode* m_pRight; BinaryTreeNode* m_pParent; }; BinaryTreeNode* GetNext(BinaryTre

#ifndef BINARYTREE_H #define BINARYTREE_H #include struct BinaryTreeNode { int m_nValue; BinaryTreeNode* m_nLeft; BinaryTreeNode* m_nRight; }; BinaryTreeNode* CreatBinaryTre

//数字在排序数组中出现的次数 #include using namespace std; int GetFirstK(const int* data,int length,int k,int start,int end); int GetLastK(const int* data,int length,int k,int start,int end); int GetNumberOfK

List.h #include "List.h" #include #include void PrintListReversingly_Iteratively(ListNode* pHead) { std::stack nodes; ListNode* pNode = pHead; while(pNode!=nullptr) { node

#include #include #include using namespace std; struct Node { int value; Node* next; Node(int v):value(v){} }; void InsertList(Node *head,int key) { Node* NewNode = new Node(key)