菜鸟502的博客

二叉树链式存储结构typedef struct BiTNode{ char data; BiTNode *lchild, *rchild;} BiTNode, *BiTree;二叉树创建（递归）void create_bitree(BiTree &T){ char value; cin >> value; if(value == '#')

题目来源： https://leetcode.com/problems/binary-tree-preorder-traversal/ https://leetcode.com/problems/binary-tree-inorder-traversal/ struct TreeNode { int val; TreeNode *left; TreeNode *ri

无向图的邻接矩阵基本操作

链式存储无向图的基本操作

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.Subscribe to see which companies asked