Skip to content
View RaymondAmesSpruance's full-sized avatar
0 followers · 2 following

Block or report RaymondAmesSpruance

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Popular repositories Loading

  1. isomorphism-of-trees-ZJU-Datastructure isomorphism-of-trees-ZJU-Datastructure Public

    给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2，则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的，因为我们把其中一棵树的结点A、B、G的左右孩子互换后，就得到另外一棵树。而图2就不是同构的。 图1 图2 现给定两棵树，请你判断它们是否是同构的。 输入格式: 输入给出2棵二叉树树的信息。对于每棵树，首先在一行中给出一个非负整数NNN (≤10\le 10≤10)，…

    C++ 1

  2. caffe caffe Public

    Forked from BVLC/caffe

    Caffe: a fast open framework for deep learning.

    C++

  3. Is-It-The-Same-Binary-Search-Tree- Is-It-The-Same-Binary-Search-Tree- Public

    04-树4 是否同一棵二叉搜索树 (25分) 给定一个插入序列就可以唯一确定一棵二叉搜索树。然而，一棵给定的二叉搜索树却可以由多种不同的插入序列得到。例如分别按照序列{2, 1, 3}和{2, 3, 1}插入初始为空的二叉搜索树，都得到一样的结果。于是对于输入的各种插入序列，你需要判断它们是否能生成一样的二叉搜索树。 输入格式: 输入包含若干组测试数据。每组数据的第1行给出两个正整数NNN …

  4. List-Leaves List-Leaves Public

    Given a tree, you are supposed to list all the leaves in the order of top down, and left to right. Input Specification: Each input file contains one test case. For each case, the first line gives a…

    C++

  5. Some-simple-experiments-on-Dynanmic-Linked-Library Some-simple-experiments-on-Dynanmic-Linked-Library Public

  6. Install-BinaryConnect-On-Windows10 Install-BinaryConnect-On-Windows10 Public