白板编程的时候,记得首先明确数据结构,梳理解题思路,设计相关函数与形参,再进行编程
1、树
struct TreeNode{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x):val(x),left(NULL),right(NULL){}
};
2、单向链表
struct ListNode{
int val;
ListNode* next;
ListNode(int x):val(x),next(NULL){}
};
3、双向链表
class Node {
public:
int val;
Node* left;
Node* right;
Node() {}
Node(int _val) {
val = _val;
left = NULL;
right = NULL;
}
Node(int _val, Node* _left, Node* _right) {
val = _val;
left = _left;
right = _right;
}
};