资源列表
PrintTreeFromTopToBottom
- 从上往下打印二叉树，没层从左往右打印，利用队列实现-Print binary tree the top down, not left to right print layer, use queue implementation
SubstructureInTree
- 验证一个二叉树是否是另外一个树的子树，递归实现。-Verify whether a binary tree is another tree subtree recursive.
MergeSortedLists
- 合并两个排序链表，采用递归方法实现，效率高，代码全，有测试-Merge two sorted lists, using a recursive method to achieve high efficiency, the code is complete, we have the test
prime-number
- 求解质数，利用bitset实现，非常适合求解答大质数。-Solving prime number, use bitset implement, ideal for large prime numbers seeking answers.
fenchatu
- 非线性振动分析计算程序，以轴承部分参数为变量的分叉图-the calculation program of the analysis of nonlinear vibration
KthNodeFromEnd
- o（n）时间内删除链表中倒数第K个节点，效率非常高-Remove the list reciprocal within o (n) time of the first node K, the efficiency is very high
DeleteNodeInList
- 高效率删除链表中的节点，O(n)时间内完成。-High efficiency delete a node in the linked list, completed within (n) time O.
tiny
- A simple code to describe Tiny-A simple code to describe Tiny cc
A111_Rayleigh_vitharddec_STBC2x1
- A111_Rayleigh_vitharddec_STBC2x1. hope useful.
A103_Rayleigh_BCH_BPSK_interleave_no_interleave_n
- A103_Rayleigh_BCH_BPSK_interleave_no_interleave_no_scope. hope useful.
A102_Ray_Hamming_7_4_BPSK_interleaver_STBC_no_sco
- A102_Ray_Hamming_7_4_BPSK_interleaver_STBC_no_scope. hope useful
A101_Ray_Hamming_7_4_BPSK_interleaver_no_scope.ra
- A101_Ray_Hamming_7_4_BPSK_interleaver_no_scope. hope useful.