摘要:
面试题目:输入两颗二叉树A,B,判断B是不是A的子结构;#include <iostream>#include <stack>using namespace std;typedef struct BinaryTreeNode{ int value; BinaryTreeNode * lchild; BinaryTreeNode *rchild;}BinaryTreeNode;typedef BinaryTreeNode * BiTree;void CreateBiTreeByLevel(BiTree &t,int Array[],int i,int len){ 阅读全文